#include <cstdio>
#include <vector>
#include <algorithm>

int n, q;
std::vector<int> a, b;
bool special = false;

bool checkok(std::vector<int>& vector) {
    std::sort(vector.begin(), vector.end());
    if (vector.front() != 1) return false;
    for (size_t i = 1; i < vector.size(); ++i) {
        if (vector[i] - vector[i - 1] > 1) return false;
    }
    return true;
}

int main() {
    freopen("intervallavretni.in", "r", stdin);
    freopen("intervallavretni.out", "w", stdout);
    scanf("%d %d", &n, &q);
    a.resize(n), b.resize(n);
    for (int i = 0; i < n; ++i) {
        scanf("%d %d", &a[i], &b[i]);
    }
    
    while (q--) {
        int l, r;
        scanf("%d %d", &l, &r);
        std::vector<int> vector(b.begin() + l, b.begin() + r + 1);
        if (checkok(vector)) {
            printf("1 ");
        } else {
            printf("0 ");
        }
    }
    return 0;
}