#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>

#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false)
template<typename T, typename... Ts> void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; }
template<typename T, typename... Ts> void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; }
template<typename... Ts> void input(Ts&... ts) { (cin >> ... >> ts); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
// clang-format on

#include <functional>
template<typename T>
class SegmentTreeOneAll {
    using Func = function<T(T, T)>;

public:
    vector<T> data;
    int n;
    T init;
    Func update_func;
    Func query_func;
    SegmentTreeOneAll(int _n, T _init, Func up, Func qu) {
        init = _init;
        update_func = up;
        query_func = qu;
        for (n = 1; n < _n; n *= 2)
            ;
        data.resize(2 * n - 1, init);
    }
    void update(int pos, T val) {
        pos += n - 1;
        data[pos] = update_func(data[pos], val);
        while (pos > 0) {
            pos = (pos - 1) / 2;
            data[pos] = query_func(data[2 * pos + 1], data[2 * pos + 2]);
        }
    }
    T query(int l, int r) {
        T resL = init, resR = init;
        for (l += n - 1, r += n - 1; l < r; l = l / 2, r = (r - 1) / 2) {
            if (!(l & 1)) {
                resL = query_func(resL, data[l]);
            }
            if (!(r & 1)) {
                resR = query_func(data[r - 1], resR);
            }
        }
        return query_func(resL, resR);
    }
};

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, k, q;
    cin, n, k, q;
    vector<vector<int>> add(n), sub(n);
    vector<P> block(k);
    vector<int> color(k);
    rep(i, 0, k) {
        int l, r, c, h;
        cin, l, r, c, h;
        l--;
        r--;
        add[l].emplace_back(i);
        sub[r].emplace_back(i);
        block[i] = P(c, h);
        color[i] = c;
    }
    vector<vector<P>> query(n);
    rep(i, 0, q) {
        ll a, b;
        cin, a, b;
        a--;
        query[a].emplace_back(b, i);
    }
    vector<int> ans(q, -1);

    auto SUM = [](ll a, ll b) { return a + b; };

    SegmentTreeOneAll<ll> seg(k, 0, SUM, SUM);

    rep(i, 0, n) {
        for (auto idx : add[i]) {
            seg.update(idx, block[idx].second);
        }

        for (auto [x, idx] : query[i]) {
            int l = 0, r = k - 1, a = -1;
            while (l <= r) {
                int mid = (l + r) / 2;
                ll s = seg.query(0, mid + 1);
                // dump(i, x, idx, l, r, mid, s);
                if (s >= x) {
                    r = mid - 1;
                    a = mid;
                } else {
                    l = mid + 1;
                }
            }
            if (a != -1) {
                ans[idx] = color[a];
            }
        }

        for (auto idx : sub[i]) {
            seg.update(idx, -block[idx].second);
        }
    }

    rep(i, 0, q) {
        print(ans[i]);
    }

    return 0;
}