#include <atcoder/all>
#include <bits/stdc++.h>
using ll = long long;
using ull = unsigned long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
using namespace std;
using namespace atcoder;
using mint = modint998244353;
const int inf = 1000000007;
const ll longinf = 1ll << 60;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, m;
    cin >> n >> m;
    vector<pair<ll, ll>> p(n), q(m);
    rep(i, n) {
        cin >> p[i].first >> p[i].second;
        p[i].second++;
    }
    rep(i, m) {
        cin >> q[i].first >> q[i].second;
        q[i].second++;
    }
    int k;
    cin >> k;
    vector<ll> a(k);
    rep(i, k) cin >> a[i];

    sort(p.begin(), p.end());
    sort(q.begin(), q.end());
    rep(i, n - 1) {
        if(p[i].second > p[i + 1].first) {
            rep(i, k) cout << "1 ";
            cout << endl;
            return 0;
        }
    }
    rep(i, m - 1) {
        if(q[i].second > q[i + 1].first) {
            rep(i, k) cout << "1 ";
            cout << endl;
            return 0;
        }
    }
    vector<int> ans(k);
    rep(i, m) {
        rep(j, k) {
            ll l = 2 * a[j] - q[i].second + 1, r = 2 * a[j] - q[i].first + 1;
            int _idx = lower_bound(p.begin(), p.end(), make_pair(l, r)) - p.begin();
            _idx -= 2;
            rep(ii, 5) {
                int idx = ii + _idx;
                if(idx < 0 || idx >= n)
                    continue;
                if(max(p[idx].first, l) < min(p[idx].second, r)) {
                    ans[j] = 1;
                }
            }
        }
    }
    rep(i, k) cout << ans[i] << " \n"[i + 1 == k];
    return 0;
}