#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <array>
#include <cmath>
#include <atcoder/modint>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(i64 i=0; i<(i64)(n); i++)
#define repr(i,n) for(i64 i=(i64)(n)-1; i>=0; i--)
const i64 INF = 1001001001001001001;
const char* yn(bool x){ return x ? "Yes" : "No"; }
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
template<typename A> using nega_queue = std::priority_queue<A,std::vector<A>,std::greater<A>>;
using Modint = atcoder::static_modint<998244353>;
//#include "nachia/vec.hpp"
using namespace std;

void testcase(){
    i64 N, M; cin >> N >> M;
    vector<pair<i64,i64>> A(N);
    for(auto& [u,v] : A) cin >> u >> v;
    sort(A.begin(), A.end());
    vector<pair<i64,i64>> B(M);
    for(auto& [u,v] : B) cin >> u >> v;
    sort(B.begin(), B.end());
    i64 K; cin >> K;
    vector<i64> P(K); rep(i,K) cin >> P[i];
    vector<int> ans(K);
    {
        i64 minSafe = INF;
        i64 maxSafe = -INF;
        rep(i,N-1) if(A[i].second >= A[i+1].first) chmin(minSafe, A[i+1].first);
        rep(i,M-1) if(B[i].second >= B[i+1].first) chmax(maxSafe, B[i].second);
        //rep(i,K) if(P[i] <= maxSafe || minSafe <= P[i]) ans[i] = 1;
        rep(i,K) if(maxSafe != -INF || minSafe != INF) ans[i] = 1;
        rep(i,N-1) chmax(A[i+1].first, A[i].second);
        rep(i,M-1) chmax(B[i+1].first, B[i].second);
    }
    auto FindA = [&](i64 l, i64 r) -> bool {
        auto i = lower_bound(A.begin(), A.end(), make_pair(l, -INF)) - A.begin();
        if(i != 0 && l <= A[i-1].second) return true;
        if(i != N && A[i].first <= r) return true;
        return false;
    };
    rep(k,K){
        i64 p = P[k];
        for(auto [u,v] : B){
            if(FindA(p*2-v, p*2-u)) ans[k] = 1;
        }
    }
    rep(i,K){
        if(i) cout << ' ';
        cout << (ans[i] ? 1 : 0);
    } cout << '\n';
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    #ifdef NACHIA
    int T; cin >> T; for(int t=0; t<T; T!=++t?(cout<<'\n'),0:0)
    #endif
    testcase();
    return 0;
}