#include <bits/stdc++.h>
using namespace std;
const int inf = 200009;
pair<int, int> num[inf + inf];
vector<int> adj[inf];
struct nod {
  int x1, x2, y1, y2;
} que[inf];
bool sol[inf];
pair<int, int> sgt[inf * 4];
vector<int> rook[inf];
int idx[inf];
void build(int x, int l, int r) {
  sgt[x].first = sgt[x].second = 0;
  if (l == r) {
    idx[l] = x;
    return;
  }
  build(x + x, l, (l + r) / 2);
  build(x + x + 1, (l + r) / 2 + 1, r);
}
void update(int x, int v) {
  x = idx[x];
  sgt[x].first = 1, sgt[x].second = v;
  x = x >> 1;
  while (x) {
    sgt[x].first = sgt[x + x].first + sgt[x + x + 1].first;
    sgt[x].second = min(sgt[x + x].second, sgt[x + x + 1].second);
    x = x >> 1;
  }
}
int s, e;
pair<int, int> query(int x, int l, int r) {
  if (s <= l && e >= r) return sgt[x];
  pair<int, int> a, b;
  a = b = make_pair(0, inf - 1);
  if ((l + r) / 2 >= s) a = query(x + x, l, (l + r) / 2);
  if ((l + r) / 2 + 1 <= e) b = query(x + x + 1, (l + r) / 2 + 1, r);
  return make_pair(a.first + b.first, min(a.second, b.second));
}
int main() {
  int n, m, k, q;
  scanf("%d%d%d%d", &n, &m, &k, &q);
  for (int i = 0; i < k; ++i) scanf("%d%d", &num[i].first, &num[i].second);
  for (int i = 0; i < q; ++i)
    scanf("%d%d%d%d", &que[i].x1, &que[i].y1, &que[i].x2, &que[i].y2);
  build(1, 1, n);
  for (int i = 0; i < k; ++i) rook[num[i].second].push_back(num[i].first);
  for (int i = 0; i < q; ++i) adj[que[i].y2].push_back(i);
  for (int i = 1; i <= m; ++i) {
    for (int j = 0; j < (int)rook[i].size(); ++j) update(rook[i][j], i);
    for (int j = 0; j < (int)adj[i].size(); ++j) {
      s = que[adj[i][j]].x1, e = que[adj[i][j]].x2;
      pair<int, int> h = query(1, 1, n);
      if (h.first == e - s + 1 && h.second >= que[adj[i][j]].y1)
        sol[adj[i][j]] = true;
    }
  }
  build(1, 1, m);
  for (int i = 1; i <= m; ++i) rook[i].clear(), adj[i].clear();
  for (int i = 0; i < k; ++i) rook[num[i].first].push_back(num[i].second);
  for (int i = 0; i < q; ++i) adj[que[i].x2].push_back(i);
  for (int i = 1; i <= n; ++i) {
    for (int j = 0; j < (int)rook[i].size(); ++j) update(rook[i][j], i);
    for (int j = 0; j < (int)adj[i].size(); ++j) {
      s = que[adj[i][j]].y1, e = que[adj[i][j]].y2;
      pair<int, int> h = query(1, 1, m);
      if (h.first == e - s + 1 && h.second >= que[adj[i][j]].x1)
        sol[adj[i][j]] = true;
    }
  }
  for (int i = 0; i < q; ++i) printf(sol[i] ? "YES\n" : "NO\n");
}
