#include using namespace std; // Short forms #define int long long #define ll long long #define lld long double #define ull unsigned long long #define endl '\n' #define ff first #define ss second #define all(x) x.begin(), x.end() #define sz(x) (int)(x).size() #define pb push_back #define ppb pop_back #define mp make_pair #define ins insert // STLs #define PII pair #define VI vector #define VVI vector> #define SI set #define SC set #define MII map #define VLL vector #define VVL vector> #define SL set // Outputs #define yes cout<<"YES"< void _print(pair p); template void _print(vector v);template void _print(set v); template void _print(map v);template void _print(multiset v); template void _print(pair p) {cerr << "{"; _print(p.first); cerr << ","; _print(p.second); cerr << "}";} template void _print(vector v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";} template void _print(set v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";} template void _print(multiset v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";} template void _print(map v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";} ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// void solve() { int n,k; cin>>n>>k; VI v(51,0); while(n--) { int l,r; cin>>l>>r; if(l==r && k==l) v[k]++; else if(l<=k && r>=k) { for(int i=l; i<=r; ++i) v[i]++; } } auto mx=max_element(v.begin(), v.end()); int index=mx-v.begin(); int max_count= count(v.begin(),v.end(),*mx); if(index==k && max_count==1) yes; else no; } int32_t main() { FAST_IO; int TC = 1; cin >> TC; while (TC--) solve(); }