#include <bits/stdc++.h>
using namespace std;
const int maxx = 2e5;
int seg[2][maxx * 4];
bool can(int ind, int now, int l, int r, int b, int e, int need) {
  if (b > e) {
    return 1;
  }
  if (b == l && e == r) {
    return (seg[ind][now] >= need);
  }
  int mid = (l + r) / 2;
  return (can(ind, now * 2, l, mid, b, min(e, mid), need) &&
          can(ind, now * 2 + 1, mid + 1, r, max(b, mid + 1), e, need));
}
void update(int ind, int now, int l, int r, int b, int need) {
  if (l == b && r == b) {
    seg[ind][now] = max(seg[ind][now], need);
    return;
  }
  int mid = (l + r) / 2;
  if (b <= mid) {
    update(ind, now * 2, l, mid, b, need);
  } else {
    update(ind, now * 2 + 1, mid + 1, r, b, need);
  }
  seg[ind][now] = min(seg[ind][now * 2], seg[ind][now * 2 + 1]);
}
struct event {
  int t, x, y, ind;
};
bool comp1(event a, event b) {
  if (a.x == b.x) {
    return a.t < b.t;
  }
  return a.x < b.x;
}
bool comp2(event a, event b) {
  if (a.y == b.y) {
    return a.t < b.t;
  }
  return a.y < b.y;
}
void solve() {
  int n, m, k, q;
  cin >> n >> m >> k >> q;
  vector<event> a;
  for (int i = 0; i < k; i++) {
    int x, y;
    cin >> x >> y;
    a.push_back({0, x, y, i});
  }
  int x[q], y[q], x1[q], y1[q];
  for (int i = 0; i < q; i++) {
    cin >> x[i] >> y[i] >> x1[i] >> y1[i];
    a.push_back({1, x1[i], y1[i], i});
  }
  sort(a.begin(), a.end(), comp1);
  bool cann[q];
  for (int i = 0; i < a.size(); i++) {
    if (a[i].t == 0) {
      update(1, 1, 0, maxx - 1, a[i].y, a[i].x);
    } else {
      if (can(1, 1, 0, maxx - 1, y[a[i].ind], y1[a[i].ind], x[a[i].ind])) {
        cann[a[i].ind] = 1;
      } else {
        cann[a[i].ind] = 0;
      }
    }
  }
  sort(a.begin(), a.end(), comp2);
  for (int i = 0; i < a.size(); i++) {
    if (a[i].t == 0) {
      update(0, 1, 0, maxx - 1, a[i].x, a[i].y);
    } else {
      if (can(0, 1, 0, maxx - 1, x[a[i].ind], x1[a[i].ind], y[a[i].ind])) {
        cann[a[i].ind] = 1;
      }
    }
  }
  for (int i = 0; i < q; i++) {
    if (cann[i]) {
      cout << "YES";
    } else {
      cout << "NO";
    }
    cout << "\n";
  }
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
