#include<bits/stdc++.h>
#define N 250005
#define db double
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int T,n,m,k,a[N],b[N],c[N<<2],d[N<<2],cnt,op,x,y,z,ans,last;
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
void ckmax(int &x,int y){if(y>x)x=y;}
void ckmin(int &x,int y){if(y<x)x=y;}
int fp(int a,int n,int mod){
    int ans=1;
    while(n){
        if(n&1)ans=ans*a%mod;
        a=a*a%mod;
        n>>=1;
    }
    return ans;
}
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int po(int x){return x*x;}
int sub(int x,int y){return x>y?x-y:y-x;}
int ab(int x){return x<0?-x:x;}
int read(){
    int sum=0;bool f=0;char c=getchar();
    for(;c<48||c>57;c=getchar())if(c==45)f=1;
    for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
    return f?-sum:sum;
}
signed main(){
    freopen("intervallavretni.in","r",stdin);freopen("intervallavretni.out","w",stdout);
    n=read();k=read();
    fo(i,1,n)a[i]=read(),b[i]=read(),c[++m]=a[i],c[++m]=b[i];
    sort(c+1,c+m+1);cnt=m;
    fo(i,1,m-1)if(c[i]+1<c[i+1])c[++cnt]=c[i]+1;
    sort(c+1,c+cnt+1);
    m=unique(c+1,c+cnt+1)-c-1;
    while(k--){
        x=read()+1;y=read()+1;
        fo(i,1,m)d[i]=0;
        fo(i,x,y)d[b[i]]=1;
        fo(i,1,m)d[i]+=d[i-1];
        bool f=1;
        fo(i,x,y)
            if(d[b[i]-1]-d[a[i]-1]!=b[i]-a[i]){
                f=0;
                break;
            }
        printf("%d ",f);
    }
    return 0;
}