#include <bits/stdc++.h>
using namespace std;
class segment_tree {
  vector<long long> t;
  long size;

 public:
  segment_tree(long n) {
    t.assign(4 * n + 1, 0);
    size = n;
  }
  void initialize_array(vector<long long>& v) {
    initialize_with_array(1, 0, size - 1, v);
  }
  void initialize_with_array(long startpos, long l, long r,
                             vector<long long>& v) {
    if (l == r) {
      t[startpos] = v[l];
    } else {
      long m = (l + r) / 2;
      initialize_with_array(2 * startpos, l, m, v);
      initialize_with_array(2 * startpos + 1, m + 1, r, v);
      if (0 == 1)
        t[startpos] = max(t[startpos * 2], t[startpos * 2 + 1]);
      else
        t[startpos] = min(t[startpos * 2], t[startpos * 2 + 1]);
    }
  }
  void update(long index, long long val) {
    update_full(1, 0, size - 1, index, val);
  }
  void update_full(long startpos, long l, long r, long index, long long val) {
    if (l == r) {
      t[startpos] = val;
    } else {
      long m = (l + r) / 2;
      if (index <= m)
        update_full(2 * startpos, l, m, index, val);
      else
        update_full(2 * startpos + 1, m + 1, r, index, val);
      if (0)
        t[startpos] = max(t[startpos * 2], t[startpos * 2 + 1]);
      else
        t[startpos] = min(t[startpos * 2], t[startpos * 2 + 1]);
    }
  }
  long long query(long l, long r) {
    if (l > r) {
      if (0)
        return 0;
      else
        return 1E9;
    }
    return query_full(1, 0, size - 1, l, r);
  }
  long long query_full(long startpos, long left, long right, long l, long r) {
    if ((left >= l) && (right <= r)) return t[startpos];
    long m = (left + right) / 2;
    long long ans;
    if (0)
      ans = -1E9;
    else
      ans = 1E9;
    if (m >= l) {
      if (0)
        ans = max(ans, query_full(startpos * 2, left, m, l, r));
      else
        ans = min(ans, query_full(startpos * 2, left, m, l, r));
    }
    if (m + 1 <= r) {
      if (0)
        ans = max(ans, query_full(startpos * 2 + 1, m + 1, right, l, r));
      else
        ans = min(ans, query_full(startpos * 2 + 1, m + 1, right, l, r));
    }
    return ans;
  }
};
class fenwick_tree {
  vector<long> t;
  long size;

 public:
  fenwick_tree(long n) {
    t.assign(n + 1, 0);
    size = n + 1;
  }
  long LSOne(long k) { return k & (-k); }
  void update(long index, long val) {
    for (; index < size; index += LSOne(index)) t[index] += val;
  }
  long query_full(long a, long b) {
    return query(b) - ((a <= 1) ? 0 : query(a - 1));
  }
  long query(long b) {
    if (b < 1) return 0;
    long sum = 0;
    for (; b; b -= LSOne(b)) sum += t[b];
    return sum;
  }
};
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m, k, q, i, j, xx, yy;
  cin >> n >> m >> k >> q;
  vector<int> x(k), y(k), x1(q), y1(q), x2(q), y2(q);
  vector<bool> v1(q, false), v2(q, false);
  vector<vector<int>> xlist(n + 1), ylist(m + 1);
  vector<vector<int>> qxlist(n + 1), qylist(m + 1);
  for (i = 0; i < k; i++) {
    cin >> x[i] >> y[i];
    xlist[x[i]].push_back(y[i]);
    ylist[y[i]].push_back(x[i]);
  }
  for (i = 0; i < q; i++) {
    cin >> x1[i] >> y1[i] >> x2[i] >> y2[i];
    qxlist[x2[i]].push_back(i);
    qylist[y2[i]].push_back(i);
  }
  segment_tree stx(m + 1), sty(n + 1);
  fenwick_tree ftx(m + 1), fty(n + 1);
  vector<bool> usedx(n + 1, false), usedy(m + 1, false);
  for (i = 1; i <= n; i++) {
    for (auto p : xlist[i]) {
      stx.update(p, i);
      if (!usedy[p]) {
        ftx.update(p, 1);
        usedy[p] = true;
      }
    }
    for (auto id : qxlist[i]) {
      xx = stx.query(y1[id], y2[id]);
      yy = ftx.query_full(y1[id], y2[id]);
      if ((xx >= x1[id]) && (yy == y2[id] + 1 - y1[id])) v1[id] = true;
    }
  }
  for (i = 1; i <= m; i++) {
    for (auto p : ylist[i]) {
      sty.update(p, i);
      if (!usedx[p]) {
        fty.update(p, 1);
        usedx[p] = true;
      }
    }
    for (auto id : qylist[i]) {
      xx = sty.query(x1[id], x2[id]);
      yy = fty.query_full(x1[id], x2[id]);
      if ((xx >= y1[id]) && (yy == x2[id] + 1 - x1[id])) v2[id] = true;
    }
  }
  for (i = 0; i < q; i++) {
    if (v1[i] || v2[i])
      cout << "YES\n";
    else
      cout << "NO\n";
  }
  return 0;
}
