#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint998244353;
//const int mod = 998244353;
//using mint = modint1000000007;
//const int mod = 1000000007;
const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<long long,long long>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector<P>v0(n), v1(m);
	rep(i, n) cin >> v0[i].first >> v0[i].second;
	sort(all(v0));

	rep(i, m) cin >> v1[i].first >> v1[i].second;
	sort(all(v1));

	int k; cin >> k;
	vector<long long>p(k);
	rep(i, k)cin >> p[i];
	bool chk = false;
	{
		rep(i, n - 1) {
			if (v0[i].second >= v0[i + 1].first)chk = true;
		}
		rep(i, m - 1) {
			if (v1[i].second >= v1[i + 1].first)chk = true;
		}
	}
	if (chk) {
		rep(i, k)cout << 1 << " ";
		cout << endl;
		return 0;
	}
	vector<int>ans(k);
	rep(i, m)rep(j, k) {
		auto itr = lower_bound(all(v0), P(2 * p[j] - v1[i].first + 1, INT_MIN));
		if (itr == v0.begin())continue;
		auto[L, R] = *prev(itr);
		if (2 * p[j] - v1[i].second <= R)ans[j] = 1;
	}
	rep(i, k)cout << ans[i] << " ";
	cout << endl;
	return 0;
}