#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a >= b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int main(){
    ll n,m;cin >> n >> m;
    vpl a(n),b(m);
    rep(i,n)cin >> a[i].first >> a[i].second;
    rep(i,m){
        cin >> b[i].first >> b[i].second;
    }
    bool xxx=false;
    sort(all(a));sort(all(b));
    rep(i,n-1){
        if(a[i].second>=a[i+1].first)xxx=true;
    }
    rep(i,m-1){
        if(b[i].second>=b[i+1].first)xxx=true;
    }
    ll k;cin >> k;
    if(xxx==true){
        rep(_,k)cout << 1 <<" ";cout << endl;
        return 0;
    }
    rep(_,k){
        ll p;cin >> p;
        bool ok=false;
        rep(i,m){
            ll t1=b[i].first-p,t2=b[i].second-p;
            //cout << t1 << " " << t2 << endl;
            auto itr=upper_bound(all(a),make_pair(p-t1,INF));
            if(itr!=a.begin())itr--;
            if(itr->first+t1<=p&&itr->second+t2>=p)ok=true;
        }
        cout << ok <<" ";
    }cout << endl;
}