#include<iostream>
#include<algorithm>
using namespace std;
struct book{
int a,b,c;
}s[100099];
bool bj(book e,book d)
{
if(e.c>=0&&d.c<=0)
return 1;
else if(e.c<0&&d.c>0)
return 0;
else
return e.a<d.a;
}
int main()
{
int sum,n,v,t;
long long j;
cin>>t;
while(t--){
sum=0;
cin>>n>>v;
for(int i=0;i<n;i++){
cin>>s[i].a>>s[i].b;
s[i].c=s[i].b-s[i].a;
}
sort(s,s+n,bj);
j=v;
for(int i=0;i<n;i++){
if(j>=s[i].a){
sum++;
j+=s[i].c;
}
else
break;
}
if(sum<n)
cout<<"no"<<endl;
else
cout<<"yes"<<endl;
}
return 0;
}