#include <bits/stdc++.h>
using namespace std;
const int N=200007;
int n,k,q,a,b,p,c,i;
int main(){
cin>>n>>k>>q;
for(i=0;i<n;i++)cin>>a>>b,p++,p--;
for(i=1;i<N;i++)p+=p,c+=c+(p>=k);
for(i=0;i<q;i++){cin>>a>>b;cout<<c-c<<'n'; }
}
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
const int N=5010;
int n,m,c,d,fa;
int w,head,next;
void add(int f,int t){
static int cnt=0;
w=t;
next=head;
head=cnt;
}
int...
#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<cmath>
using namespace std;
const int maxn=1e4+5;
const int inf=0x7f7f7f7f;
int x,y,dis;
bool vis;
int k,n,m;
int bfs()
{
queue<int>q;
q.push(1);
//memset
//for(int i=1;i<=n;i++)dis=inf;
memset(dis,0x7f,sizeof...
