#include<iostream>
using namespace std;
int main(){
int t; cin>>t;
while(t--){
int lMax=0,rMin=0;
int n,k;
cin>>n>>k;
for(int i=0; i<n; i++){
int l,r;
cin>>l>>r;
if(l==k){
lMax=1;
}
if (r==k){
rMin=1;
}
}
if(lMax&&rMin){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
}
}
Lift queries | Goki and his breakup |
Ali and Helping innocent people | Book of Potion making |
Duration | Birthday Party |
e-maze-in | Bricks Game |
Char Sum | Two Strings |
Anagrams | Prime Number |
Lexical Sorting Reloaded | 1514A - Perfectly Imperfect Array |
580A- Kefa and First Steps | 1472B- Fair Division |
996A - Hit the Lottery | MSNSADM1 Football |
MATCHES Playing with Matches | HRDSEQ Hard Sequence |
DRCHEF Doctor Chef | 559. Maximum Depth of N-ary Tree |
821. Shortest Distance to a Character | 1441. Build an Array With Stack Operations |
1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |
344. Reverse String | 1047. Remove All Adjacent Duplicates In String |
977. Squares of a Sorted Array | 852. Peak Index in a Mountain Array |