#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:133217728")
using namespace std;
int t[400800];
vector<int> x[100200];
vector<int> y[100200];
bool ok[200100];
int a[200100], aa[200100], b[200100], bb[200100];
vector<int> xr[100200];
vector<int> yr[100200];
void build(int v, int tl, int tr) {
  if (tl == tr)
    t[v] = -1;
  else {
    int tm = (tr + tl) >> 1;
    build(v << 1, tl, tm);
    build(v << 1 | 1, tm + 1, tr);
    t[v] = -1;
  }
}
void upd(int v, int tl, int tr, int pos, int val) {
  if (tl == tr)
    t[v] = val;
  else {
    int tm = (tr + tl) >> 1;
    if (tm >= pos)
      upd(v << 1, tl, tm, pos, val);
    else
      upd(v << 1 | 1, tm + 1, tr, pos, val);
    t[v] = min(t[v << 1], t[v << 1 | 1]);
  }
}
int f(int v, int tl, int tr, int l, int r) {
  if (l > tr || tl > r || l > r) return 47474747;
  if (tl >= l && tr <= r) return t[v];
  int tm = (tr + tl) >> 1;
  int a = f(v << 1, tl, tm, l, r);
  int b = f(v << 1 | 1, tm + 1, tr, l, r);
  return min(a, b);
}
int main() {
  ios_base::sync_with_stdio(0);
  int n, m, p, q;
  cin >> n >> m >> p >> q;
  for (int i = 0; i < p; i++) {
    int xx, yy;
    cin >> xx >> yy;
    x[xx].push_back(yy);
    y[yy].push_back(xx);
  }
  for (int i = 0; i < q; i++) {
    cin >> a[i] >> b[i] >> aa[i] >> bb[i];
    xr[aa[i]].push_back(i);
    yr[bb[i]].push_back(i);
  }
  build(1, 1, 100000);
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < x[i].size(); j++) upd(1, 1, 100000, x[i][j], i);
    for (int j = 0; j < xr[i].size(); j++) {
      int L = b[xr[i][j]];
      int R = bb[xr[i][j]];
      if (f(1, 1, 100000, L, R) >= a[xr[i][j]]) ok[xr[i][j]] = 1;
    }
  }
  build(1, 1, 100000);
  for (int i = 1; i <= m; i++) {
    for (int j = 0; j < y[i].size(); j++) upd(1, 1, 100000, y[i][j], i);
    for (int j = 0; j < yr[i].size(); j++) {
      int L = a[yr[i][j]];
      int R = aa[yr[i][j]];
      if (f(1, 1, 100000, L, R) >= b[yr[i][j]]) ok[yr[i][j]] = 1;
    }
  }
  for (int i = 0; i < q; i++)
    if (ok[i])
      cout << "YES\n";
    else
      cout << "NO\n";
  return 0;
}
