#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 7;
const long double EPS = 1e-14;
const int LAD = 0;
const int REQ = 1;
struct Event {
  int type;
  int val;
  int id;
  Event(int type, int val, int id) {
    this->id = id;
    this->val = val;
    this->type = type;
  }
  bool operator<(const Event &ev) const {
    return val < ev.val || val == ev.val && type < ev.type ||
           val == ev.val && type == ev.type && id < ev.id;
  }
};
vector<pair<int, int> > lads;
vector<Event> evs;
vector<int> tree;
vector<pair<int, int> > gransy;
vector<pair<int, int> > gransx;
int N;
void build(int v, int l, int r) {
  if (l == r) {
    tree[v] = -1;
  } else {
    int m = (l + r) >> 1;
    build(v * 2, l, m);
    build(v * 2 + 1, m + 1, r);
    tree[v] = min(tree[v * 2], tree[v * 2 + 1]);
  }
}
void init() {
  tree.assign(N * 4, -1);
  build(1, 0, N - 1);
}
void update(int v, int tl, int tr, int pos, int val) {
  if (tl == tr) {
    tree[v] = val;
  } else {
    int tm = (tl + tr) >> 1;
    if (pos <= tm) {
      update(v * 2, tl, tm, pos, val);
    } else {
      update(v * 2 + 1, tm + 1, tr, pos, val);
    }
    tree[v] = min(tree[v * 2], tree[v * 2 + 1]);
  }
}
int query(int v, int tl, int tr, int l, int r) {
  if (l > r) {
    return INF;
  }
  if (tl == l && tr == r) {
    return tree[v];
  }
  int tm = (tl + tr) >> 1;
  return min(query(v * 2, tl, tm, l, min(tm, r)),
             query(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r));
}
vector<bool> isGood;
void process() {
  for (int i = 0; i < evs.size(); i++) {
    int id = evs[i].id;
    if (evs[i].type == LAD) {
      update(1, 0, N - 1, lads[id].second, evs[i].val);
    } else {
      int l = gransy[id].first;
      int r = gransy[id].second;
      int pos = query(1, 0, N - 1, l, r);
      if (pos >= gransx[id].first) {
        isGood[id] = true;
      }
    }
  }
}
int main() {
  int n, m, k, q;
  cin >> n >> m >> k >> q;
  lads.resize(k);
  vector<Event> e1, e2;
  for (int i = 0; i < k; i++) {
    cin >> lads[i].first >> lads[i].second;
    e1.push_back(Event(LAD, lads[i].first, i));
    e2.push_back(Event(LAD, lads[i].second, i));
  }
  gransx.resize(q);
  gransy.resize(q);
  isGood.resize(q);
  for (int i = 0; i < q; i++) {
    cin >> gransx[i].first;
    cin >> gransy[i].first;
    cin >> gransx[i].second;
    cin >> gransy[i].second;
    e1.push_back(Event(REQ, gransx[i].second, i));
    e2.push_back(Event(REQ, gransy[i].second, i));
  }
  N = m + 1;
  init();
  evs = e1;
  sort(evs.begin(), evs.end());
  process();
  N = n + 1;
  init();
  evs = e2;
  sort(evs.begin(), evs.end());
  for (int i = 0; i < gransx.size(); i++) {
    swap(gransx[i], gransy[i]);
  }
  for (int i = 0; i < lads.size(); i++) {
    swap(lads[i].first, lads[i].second);
  }
  process();
  for (int i = 0; i < isGood.size(); i++) {
    if (isGood[i]) {
      cout << "YES" << endl;
    } else {
      cout << "NO" << endl;
    }
  }
  return 0;
}
