#include <iostream>
#include <cmath>
using namespace std;
int main(){
   int a[100000],b[320],m,n,i,j=-1,k,L,R,p,q,z,max=0;
   scanf("%d",&n); k=sqrt(n);
   for(i=0;i<n;++i){
#include <iostream>
#include <cmath>
using namespace std;
int main(){
   int a[10000]={0},b[100]={0},i,j,k,K,M,N,l,r,L,R,z;
   cin>>N>>K>>M;k=sqrt(N);
   while(M){M--;
         cin>>l>>r;L=l/k;R=r/k;
      if(L==R){z=a[l];for(i=l+1;i<r;i++)if(a[i]>z)z=a[i];}
      else{
      	z=a[l];for(i=l+1;i<k*(L+1);i++)if(a[i]>z)z=a[i];
      	for(i=L+1;i<R;i++)if(b[i]>z)z=b[i];
      	for(i=k*R;i<r;i++)if(a[i]>z)z=a[i];
		}
		if(z<K){cout<<"Yes"<<endl;
		   for(i=l;i<r;i++)a[i]++;
		      for(i=l;i<k*(L+1);i++)if(a[i]>b[L])b[L]=a[i];
		   for(i=L+1;i<R;i++)b[i]++;
		   for(i=k*R;i<r;i++)if(a[i]>b[R])b[R]=a[i];
		}
		      else cout<<"No"<<endl;
		}
return 0;}