#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

ll op(ll a, ll b) { return a + b; }

ll e() { return 0LL; }

ll target;

bool f(ll x) { return x < target; }

int main() {
    ll N, K, Q;
    cin >> N >> K >> Q;
    vector<ll> L(K);
    vector<ll> R(K);
    vector<ll> C(K);
    vector<ll> H(K);
    for (ll i = 0; i < K; i++) {
        cin >> L[i] >> R[i] >> C[i] >> H[i];
        L[i]--;
        R[i]--;
    }
    vector<ll> I(Q);
    vector<ll> X(Q);
    for (ll i = 0; i < Q; i++) {
        cin >> I[i] >> X[i];
        I[i]--;
    }
    segtree<ll, op, e> seg(K);

    // 現在の状態をセグ木の形で持っているので、これの二分探索で判定問題を解く
    vector<ll> ans(Q, -1);
    vector evin(N, vector<ll>(0));
    vector evout(N, vector<ll>(0));
    for (ll i = 0; i < K; i++) {
        evin[L[i]].push_back(i);
        evout[R[i]].push_back(i);
    }
    vector evq(N, vector<ll>(0));
    for (ll i = 0; i < Q; i++) {
        evq[I[i]].push_back(i);
    }

    for (ll i = 0; i < N; i++) {
        for (ll in : evin[i]) {
            seg.set(in, seg.get(in) + H[in]);
        }
        for (ll q : evq[i]) {
            target = X[q];
            ll idx = seg.max_right<f>(0);
            // debug_out(q, idx);
            if (idx == K) {
                ans[q] = -1;
            } else {
                ans[q] = C[idx];
            }
        }
        for (ll out : evout[i]) {
            seg.set(out, seg.get(out) - H[out]);
        }
    }
    for (ll i = 0; i < Q; i++) {
        cout << ans[i] << endl;
    }
}