#include #include #define SELECTER(_1,_2,_3,SELECT,...) SELECT #define rep1(i,n) for(int i=0;i<(int)n;++i) #define rep2(i,a,n) for(int i=(int)a;i<(int)n;++i) #define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__) #define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT #define rrep1(i,n) for(int i=(int)(n)-1;i>=0;--i) #define rrep2(i,a,n) for(int i=(int)(n)-1;i>=(int)a;--i) #define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__) #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define fi first #define se second #define PrintR LogOutput #ifdef _DEBUG #define Log(...) LogOutput(__VA_ARGS__) #else #define Log(...) #endif #define M_PI 3.14159265358979323846 using namespace std; using namespace atcoder; using ll=long long; using ld=long double; using pii=pair; using pll=pair; using pdd=pair; using tp=tuple; using tpll=tuple; using veci=vector; using vecpii=vector>; using vecll=vector; using vecpll=vector>; using vecpdd=vector>; using vecs=vector; using vecb=vector; using vecd=vector; using vectp=vector; using vectpll=vector; using mint=modint998244353; using mint10=modint1000000007; template istream& operator>>(istream& in, pair& a){return in >> a.first >> a.second;} template ostream& operator<<(ostream& out, const pair& a){return out << a.first << ' ' << a.second;} ostream& operator<<(ostream& out, const mint& a){return out << a.val();} ostream& operator<<(ostream& out, const mint10& a){return out << a.val();} ostream& operator<<(ostream& out, const modint& a){return out << a.val();} template ostream& operator<<(ostream& out, const vector& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;} template pair operator+(const pair& a, const pair& b){return {a.fi + b.fi, a.se + b.se};} template pair operator-(const pair& a, const pair& b){return {a.fi - b.fi, a.se - b.se};} template inline bool chmax(T& a,T b){if(a inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;} bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;} bool PrintA(int i){cout<<(i ? "Yes" : "No")<::max() >> 2; constexpr int inf=numeric_limits::max() >> 1; constexpr ll MOD=998244353; const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0}; template void LogOutput(Args&&... args){ stringstream ss; ((ss << args << ' '), ...); cout << ss.str().substr(0, ss.str().length() - 1) << endl; } template void LogOutput(vector>& data){for(auto d : data) LogOutput(d);} int main(){ ios::sync_with_stdio(false); std::cin.tie(nullptr); int n, m;cin>>n>>m; vecpii a(n), b(m); rep(i, n) cin>>a[i]; rep(i, m) cin>>b[i]; sort(all(a)); sort(all(b)); int k;cin>>k; vecll c(k); rep(i, k) cin>>c[i]; int u = 0; int mx = -inf; rep(i, n){ if(mx >= a[i].fi) u = 1; chmax(mx, a[i].se); } mx = -inf; rep(i, m){ if(mx >= b[i].fi) u = 1; chmax(mx, b[i].se); } if(u){ rep(i, k) cout<<1<<" \n"[i == k - 1]; return 0; } vecpll t; rep(i, m) rep(j, k){ t.emplace_back(b[i].fi - 2 * c[j], -j - inf); t.emplace_back(b[i].se - 2 * c[j], j + 1); } rep(i, n){ t.emplace_back(-a[i].fi, i + inf); t.emplace_back(-a[i].se, -i); } sort(all(t)); set st, st2; veci ans(k); for(auto [l, r] : t){ if(r <= -inf){ r += inf; r = -r; st2.insert(r); }else if(r <= 0){ r = -r; st.insert(r); }else if(r >= inf){ r -= inf; st.erase(r); }else{ r--; if(st2.find(r) != st2.end()) st2.erase(r); } if(st.size()){ auto it = st2.begin(); while(it != st2.end()){ ans[*it] = 1; it = st2.erase(it); } } } PrintR(ans); }