#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int MAX_N = 1e5;
const int lim = 1e9;
const ll INF = (1LL << 60);
int t[MAX_N + 1], d[MAX_N + 1];
int minLeft[MAX_N + 1];
int n, q;
struct Node {
Node *lson;
Node *rson;
ll lazy;
ll minVal;
int cnt;
Node() {
lson = NULL;
rson = NULL;
lazy = 0;
minVal = INF;
cnt = 0;
}
};
void push(Node *&root, int l, int r) {
if (l == r) {
return;
}
if (root->lson == NULL) {
root->lson = new Node();
}
if (root->rson == NULL) {
root->rson = new Node();
}
if (root->lazy != 0) {
root->lson->lazy += root->lazy;
root->lson->minVal += root->lazy;
root->rson->lazy += root->lazy;
root->rson->minVal += root->lazy;
root->lazy = 0;
}
}
void update(Node *&root, int l, int r, int p, int q, int val) {
if (p > q) {
return;
} else if (p <= l && r <= q) {
root->minVal += val;
root->lazy += val;
} else {
push(root, l, r);
int mid = (l + r) / 2;
update(root->lson, l, mid, p, min(mid, q), val);
update(root->rson, mid + 1, r, max(p, mid + 1), q, val);
ll ql = INF, qr = INF;
if (root->lson != NULL) {
ql = root->lson->minVal;
}
if (root->rson != NULL) {
qr = root->rson->minVal;
}
root->minVal = min(ql, qr);
}
}
ll query(Node *&root, int l, int r) {
push(root, l, r);
return root->minVal;
}
void updateFreq(Node *&root, int l, int r, int x, int val) {
push(root, l, r);
if (l == r) {
if (root->cnt == 0) {
root->minVal -= INF - x;
}
root->cnt += val;
if (root->cnt == 0) {
root->minVal += INF - x;
}
return;
}
int mid = (l + r) / 2;
if (x <= mid) {
updateFreq(root->lson, l, mid, x, val);
} else {
updateFreq(root->rson, mid + 1, r, x, val);
}
ll ql = INF, qr = INF;
if (root->lson != NULL) {
ql = root->lson->minVal;
}
if (root->rson != NULL) {
qr = root->rson->minVal;
}
root->minVal = min(ql, qr);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> q;
for (int i = 1; i <= n; i++) {
cin >> t[i] >> d[i];
}
Node *root = new Node();
int j = 1;
for (int i = 1; i <= n; i++) {
updateFreq(root, 1, lim, d[i], 1);
update(root, 1, lim, d[i], lim, -t[i]);
while (query(root, 1, lim) <= 0LL) {
update(root, 1, lim, d[j], lim, t[j]);
updateFreq(root, 1, lim, d[j], -1);
j++;
}
minLeft[i] = j;
}
while (q--) {
int x, y;
cin >> x >> y;
cout << (x >= minLeft[y]) << "\n";
}
return 0;
}
