#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define fix(x) fixed << setprecision(x)
#define asc(x) x, vector<x>, greater<x>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}

struct op{
    ll l,r,c,h;
};
struct query{
    ll I,x;
};
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll n,k,q;
    const ll d = 448;
    cin >> n >> k >> q;
    vector<op> a(k);
    rep(i,k){
        cin >> a[i].l >> a[i].r >> a[i].c >> a[i].h;
        a[i].l--;
    }
    vector<ll> ans(q,-1);
    vector<query> b(q);
    rep(i,q){
        cin >> b[i].I >> b[i].x;
        b[i].I--;
    }
    ll tail = 0;
    vector<ll> tot(n+1,0), imos(n+1,0);
    auto pre = tot;
    rep(i,k){
        if(i*d>=k) break;
        pre = tot;
        tail += d;
        rep(j,n+1) imos[j] = 0;
        for(ll j=i*d;j<min(k,tail);j++){
            imos[a[j].l] += a[j].h;
            imos[a[j].r] -= a[j].h;
        }
        rep(j,n){
            tot[j] += imos[j];
            imos[j+1] += imos[j];
        }
        rep(j,q){
            ll itr = b[j].I, nh = pre[itr];
            if(ans[j]>0 || tot[itr]<b[j].x) continue;
            for(ll p=i*d;p<min(k,tail);p++){
                if(a[p].l<=itr && itr<a[p].r){
                    nh += a[p].h;
                    if(nh>=b[j].x){
                        ans[j] = a[p].c;
                        break;
                    }
                }
            }
        }
    }
    rep(i,q) cout << ans[i] << '\n';
    return 0;
}