#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define str string
#define pb push_back
#define pf push_front
#define in insert
#define all(v) v.begin(),v.end()
const int sz=100000,INF=1000000000;
using namespace std;
void solve()
{
ll n,m,num1,num2,Num1,Num2,sum,ans;
bool flag;
cin>>n>>m;
vector<ll>nums1,nums2,idxs;
for(int i=0;i<n;i++)
{
cin>>num1>>num2;
nums1.pb(num1),nums2.pb(num2);
}
for(int i=0;i<m;i++)
{
idxs.clear(),sum=0,ans=0,flag=false;
cin>>Num1>>Num2;
for(int j=Num1-1;j<Num2;j++)
{
idxs.pb(j);
}
for(int j=0;j<idxs.size();j++)
{
sum+=nums1[idxs[j]];
if(sum>=nums2[idxs[j]])
{
flag=true;
break;
}
}
if(flag)
{
while(next_permutation(all(idxs)))
{
sum=0,flag=false;
for(int j=0;j<idxs.size();j++)
{
sum+=nums1[idxs[j]];
if(sum>=nums2[idxs[j]])
{
flag=true;
break;
}
}
if(!flag)
{
ans=1;
break;
}
}
}
else
{
ans=1;
}
cout<<ans<<"\n";
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr),cout.tie(nullptr);
ll t=1;
//cin>>t;
while(t--)
{
solve();
}
}
