#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void read(T& x) {
  char c;
  bool fu = 0;
  for (c = getchar(); c <= 32; c = getchar())
    ;
  if (c == '-') fu = 1, c = getchar();
  for (x = 0; c > 32; c = getchar()) x = x * 10 + c - '0';
  if (fu) x *= -1;
}
template <class T>
inline void read(T& x, T& y) {
  read(x);
  read(y);
}
template <class T>
inline void read(T& x, T& y, T& z) {
  read(x, y);
  read(z);
}
const int nmax = 345678, mod = 1e9 + 7;
int n, t[4 * nmax], k, q, m, x;
pair<int, int> rooks[nmax];
pair<int, int> lq[nmax], rq[nmax];
char ans[nmax];
vector<int> Q[nmax], P[nmax];
int get(int l, int r, int v, int tl, int tr) {
  if (tl == l && r == tr) {
    return t[v];
  }
  int tm = (tl + tr) / 2;
  if (r <= tm) return get(l, r, 2 * v, tl, tm);
  if (l > tm) return get(l, r, 2 * v + 1, tm + 1, tr);
  return min(get(l, tm, 2 * v, tl, tm), get(tm + 1, r, 2 * v + 1, tm + 1, tr));
}
void upd(int p, int z, int v, int l, int r) {
  if (l == r) {
    t[v] = z;
    return;
  }
  int m = (l + r) / 2;
  if (p <= m)
    upd(p, z, 2 * v, l, m);
  else
    upd(p, z, 2 * v + 1, m + 1, r);
  t[v] = min(t[2 * v], t[2 * v + 1]);
}
void go() {
  memset(t, 0, sizeof(t));
  for (int _tmp = k, i = 1; i <= _tmp; ++i) {
    P[rooks[i].first].push_back(rooks[i].second);
  }
  for (int _tmp = q, i = 1; i <= _tmp; ++i) {
    Q[rq[i].first].push_back(i);
  }
  for (int _tmp = n, i = 1; i <= _tmp; ++i) {
    for (int j = 0; j < (int)P[i].size(); ++j) {
      upd(P[i][j], i, 1, 1, m);
    }
    for (int j = 0; j < (int)Q[i].size(); ++j) {
      int d = Q[i][j];
      ans[d] |= (get(lq[d].second, rq[d].second, 1, 1, m) >= lq[d].first);
    }
  }
  for (int _tmp = n, i = 1; i <= _tmp; ++i) {
    Q[i].clear();
    P[i].clear();
  }
}
int main() {
  read(n, m);
  read(k, q);
  for (int _tmp = k, i = 1; i <= _tmp; ++i)
    read(rooks[i].first, rooks[i].second);
  for (int _tmp = q, i = 1; i <= _tmp; ++i) {
    read(lq[i].first, lq[i].second);
    read(rq[i].first, rq[i].second);
  }
  go();
  swap(n, m);
  for (int _tmp = k, i = 1; i <= _tmp; ++i)
    swap(rooks[i].first, rooks[i].second);
  for (int _tmp = q, i = 1; i <= _tmp; ++i) {
    swap(lq[i].first, lq[i].second);
    swap(rq[i].first, rq[i].second);
  }
  go();
  for (int _tmp = q, i = 1; i <= _tmp; ++i) {
    if (ans[i]) {
      printf("YES\n");
    } else {
      printf("NO\n");
    }
  }
  cin.get();
  cin.get();
  return 0;
}
