#include<bits/stdc++.h>
#define ff first
#define ss second
#define ll long long
#define pb push_back
using namespace std;
typedef pair<int,int> pii;

const int mod=998244353;
inline int add(int x,int y){int ret=x+y;if(ret>=mod)ret-=mod;return ret;}
inline int sub(int x,int y){int ret=x-y;if(ret<0)ret+=mod;return ret;}
inline int mul(int x,int y){return ((ll)x*y)%mod;}
inline int step(int base,int pw){if(base==0)return 0;int ret=1;while(pw){if(pw&1)ret=mul(ret,base);base=mul(base,base);pw>>=1;}return ret;}
inline int invv(int x){return step(x,mod-2);}

const int maxn=3e5+10;

int main(){

    freopen("battle.in","r",stdin);
    freopen("battle.out","w",stdout);

    int t;
    scanf("%d",&t);
    while(t--){

        int n;
        ll h;
        scanf("%d %lld",&n,&h);
        ll sum=0;
        for(int i=1;i<=n;i++){
            ll l,r;
            scanf("%lld %lld",&l,&r);
            sum+=l*2+(r-l);
        }
        h*=2;
        if(sum%2==1)sum++;
        ///cout<<fixed<<setprecision(6)<<sum<<endl;
        if(sum>=h)printf("YES\n");
        else printf("NO\n");

    }

return 0;
}