#include <bits/stdc++.h>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(int)(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
//int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
//int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
//const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'


// https://satanic0258.github.io/snippets/data-structure/SegmentMap.html
// #### attention! : [l, r] ( include r, not [l, r) )
// if merge [l, m] and [m + 1, r], flagToMergeAdjacentSegment = true;
class RangeSet: public set<pair<long long, long long>> {
private:
  bool flagToMergeAdjacentSegment;
public:
  RangeSet() {}
  RangeSet(bool flagToMergeAdjacentSegment) : flagToMergeAdjacentSegment(flagToMergeAdjacentSegment) {}

  // get the iterator that x is in
  // noexist -> map.end()
  auto get(ll x) const {
    auto itr = upper_bound(pll(x, 1e18));
    if (itr == begin() or (--itr)->second < x) return end();
    return itr;
  }

  // insert segment [l, r]
  // return merged range
  auto add(pll lr) {
    while (true) {
      auto itr = lower_bound(pll(lr.first, -INF));
      if (itr == end()) break;
      ll r = -INF;
      if (itr->first <= lr.second + (int)flagToMergeAdjacentSegment) r = max(lr.second, itr->second);
      if (r == -INF) break;
      lr.second = r;
      erase(itr);
    }

    while (true) {
      auto itr = lower_bound(pll(lr.first, -INF));
      if (itr == begin()) break;
      itr--;
      ll l = INF;
      ll r = -INF;
      if (itr->second + (int)flagToMergeAdjacentSegment >= lr.first) {
        l = min(lr.first, itr->first);
        r = max(lr.second, itr->second);
      }
      if (l == INF) break;
      lr.first = l;
      lr.second = r;
      erase(itr);
    }
    insert(lr);
    return lower_bound(lr);
  }

  // Are x1 and x2 in the same range?
  bool same(ll x1, ll x2) {
    auto itr = get(x1);
    return itr != end() and (itr->first <= x2 and x2 <= itr->second);
  }
};


signed main() {
  int n, m, q;
  cin >> n >> m >> q;
  using P = pair<int, pii>;
  vector<P> dab(m);
  rep (i, m) {
    cin >> dab[i].first >> dab[i].second.first >> dab[i].second.second;
  }
  dab.push_back({inf, pii(1, 1)});
  sort(all(dab));
  using P2 = pair<pii, pii>;
  vector<P2> dist(q);
  rep (i, q) {
    cin >> dist[i].first.first >> dist[i].second.first >> dist[i].second.second;
    dist[i].first.second = i;
  }
  dist.push_back({{inf, inf}, {1, 1}});
  sort(all(dist));

  RangeSet st(false);
  int i = 0, j = 0;
  vector<bool> ans(q);
  while (i < dab.size() - 1 or j < dist.size() - 1) {
    if (dist[j].first.first <= dab[i].first) {
      int idx = dist[j].first.second;
      int s = dist[j].second.first, t = dist[j].second.second;
      if (s >= t) {
        ans[idx] = true;
      }
      else {
        auto itr = st.get(s);
        if (itr != st.end()) {
          if (itr->second >= t) ans[idx] = true;
        }
      }
      j++;
    }
    else {
      int a = dab[i].second.first, b = dab[i].second.second;
      st.add(pll(a, b));
      i++;
    }
  }

  rep (i, q) {
    cout << (ans[i] ? "Yes" : "No") << endl;
  }
}


Measured memory_bytes: 11432