// Code written by Auroraa_
#include "bits/stdc++.h"

using namespace std;
#define endl '\n'

const int N = 2e5 + 5;

#define ls (p<<1)
#define rs ((p<<1)|1)
#define mid ((l+r)>>1)

struct Seg {
	int l, r;
	int mn;
}seg[4 * N];
void build(int p, int l, int r) {
	seg[p].l = l, seg[p].r = r;
	seg[p].mn = 0;
	if (l == r)return;
	build(ls, l, mid);
	build(rs, mid + 1, r);
}
void upd(int p, int x, int y) {
	int l = seg[p].l, r = seg[p].r;
	if (l == r) {
		seg[p].mn = y;
		return;
	}
	if (x <= mid)upd(ls, x, y);
	else upd(rs, x, y);
	seg[p].mn = min(seg[ls].mn, seg[rs].mn);
}
int ask(int p, int x, int y) {
	int l = seg[p].l, r = seg[p].r;
	if (x <= l && y >= r)return seg[p].mn;
	int ans = 1000000;
	if (x <= mid)ans = min(ans, ask(ls, x, y));
	if (y > mid)ans = min(ans, ask(rs, x, y));
	return ans;
}
int ans[N];
struct query {
	int x1, y1, x2, y2, id;
};
bool cmp_x(query q1, query q2) { return q1.x2 < q2.x2; }
bool cmp_y(query q1, query q2) { return q1.y2 < q2.y2; }
vector<query>vec;
vector<int>v1[N], v2[N];
void solve() {
	int n, m, k, q;
	cin >> n >> m >> k >> q;
	for (int i = 1; i <= k; i++) {
		int x, y;
		cin >> x >> y;
		v1[x].push_back(y);
		v2[y].push_back(x);
	}

	for (int i = 1; i <= q; i++) {
		int x1, y1, x2, y2;
		cin >> x1 >> y1 >> x2 >> y2;
		vec.push_back({ x1, y1, x2, y2, i });
	}

	sort(vec.begin(), vec.end(), cmp_y);


	build(1, 1, n);
	int now = 0;
	for (int i = 1; i <= m; i++) {
		for (auto x : v2[i])upd(1, x, i);
		while (now < q && vec[now].y2 <= i) {
			if (ans[vec[now].id] == 1) {
				now++;
				continue;
			}
			int mn = ask(1, vec[now].x1, vec[now].x2);
			if (vec[now].y1 <= mn)ans[vec[now].id] = 1;
			now++;
		}
		if (now == q)break;
	}

	build(1, 1, m);
	sort(vec.begin(), vec.end(), cmp_x);
	now = 0;

	for (int i = 1; i <= n; i++) {
		for (auto y : v1[i]) {
			upd(1, y, i);
		}
		while (now < q && vec[now].x2 <= i) {
			if (ans[vec[now].id] == 1) {
				now++;
				continue;
			}
			int mn = ask(1, vec[now].y1, vec[now].y2);
			if (vec[now].x1 <= mn)ans[vec[now].id] = 1;
			now++;
		}
		if (now == q)break;
	}

	for (int i = 1; i <= q; i++) {
		if (ans[i] == 0)cout << "NO" << endl;
		else cout << "YES" << endl;
	}

}

signed main() {
	cin.tie(nullptr)->sync_with_stdio(false);
	int T = 1;
	//    cin>>T;
	while (T--) {
		solve();
	}
}