#include <bits/stdc++.h>
using namespace std;
const int inf = 0x7f7f7f7f;
int T[600005], ls[6000005], rs[6000005], val[6000005], idx;
inline void pushup(int rt) { val[rt] = min(val[ls[rt]], val[rs[rt]]); }
inline void build(int &rt, int l, int r) {
  rt = (++idx);
  if (l == r) return;
  build(ls[rt], l, ((l + r) >> 1));
  build(rs[rt], ((l + r) >> 1) + 1, r);
}
inline void insert(int &rt, int pre, int l, int r, int k, int ch) {
  rt = (++idx);
  ls[rt] = ls[pre];
  rs[rt] = rs[pre];
  if (l == r) return (void)(val[rt] = max(val[pre], ch));
  if (k <= ((l + r) >> 1))
    insert(ls[rt], ls[pre], l, ((l + r) >> 1), k, ch);
  else
    insert(rs[rt], rs[pre], ((l + r) >> 1) + 1, r, k, ch);
  pushup(rt);
}
inline int query(int rt, int l, int r, int L, int R) {
  if (L <= l && r <= R) return val[rt];
  int ans = inf;
  if (L <= ((l + r) >> 1))
    ans = min(ans, query(ls[rt], l, ((l + r) >> 1), L, R));
  if (R > ((l + r) >> 1))
    ans = min(ans, query(rs[rt], ((l + r) >> 1) + 1, r, L, R));
  return ans;
}
int n, m, k, s[600005], M, l[300005], r[300005], bel[300005];
vector<pair<int, int> > is[600005];
inline void solve() {
  scanf("%d %d %d", &n, &m, &k);
  for (int i = (1); i <= (k); i++) {
    scanf("%d %d %d", &l[i], &r[i], &bel[i]);
    s[++M] = l[i];
    s[++M] = r[i];
  }
  sort(s + 1, s + M + 1);
  M = unique(s + 1, s + M + 1) - s - 1;
  s[++M] = inf;
  for (int i = (1); i <= (k); i++)
    l[i] = lower_bound(s + 1, s + M + 1, l[i]) - s,
    r[i] = lower_bound(s + 1, s + M + 1, r[i]) - s;
  for (int i = (1); i <= (k); i++) is[r[i]].push_back(make_pair(l[i], bel[i]));
  build(T[0], 1, n);
  for (int i = (1); i <= (M - 1); i++) {
    T[i] = T[i - 1];
    for (pair<int, int> ins : is[i])
      insert(T[i], T[i], 1, n, ins.second, ins.first);
  }
  for (int i = (1); i <= (m); i++) {
    int a, b, x, y;
    scanf("%d %d %d %d", &a, &b, &x, &y);
    y = upper_bound(s + 1, s + M + 1, y) - s - 1;
    x = lower_bound(s + 1, s + M + 1, x) - s;
    if (query(T[y], 1, n, a, b) >= x)
      puts("yes");
    else
      puts("no");
    fflush(stdout);
  }
}
int main() { solve(); }
