/* -*- coding: utf-8 -*-
 *
 * 1982.cc:  No.1982 [Cherry 4th Tune B] 絶険 - yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 200000;
const int MAX_K = 200000;
const int MAX_QN = 200000;

/* typedef */

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,ll> pil;
typedef vector<pil> vpil;

template <typename T>
struct BIT {
  int n;
  vector<T> bits;
  
  BIT() {}
  BIT(int _n) { init(_n); }

  void init(int _n) {
    n = _n;
    bits.assign(n + 1, 0);
  }

  T sum(int x) {
    x = min(x, n);
    T s = 0;
    while (x > 0) {
      s += bits[x];
      x -= (x & -x);
    }
    return s;
  }

  void add(int x, T v) {
    if (x <= 0) return;
    while (x <= n) {
      bits[x] += v;
      x += (x & -x);
    }
  }

  int lower_bound(T v) {
    int	k = 1;
    while ((k << 1) <= n) k <<=	1;
    int	x = 0;
    for	(; k > 0; k >>= 1)
      if (x + k <= n && bits[x + k] < v) {
        x += k;
        v -= bits[x];
      }
    return x + 1;
  }
};

template <typename T>
struct BIT2D {
  int n;
  vector<BIT<T> > bits;
  
  BIT2D() {}
  BIT2D(int _ny, int _nx) { init(_ny, _nx); }

  void init(int _ny, int _nx) {
    n = _ny;
    bits.assign(n + 1, BIT<T>());
    for (int y = 1; y <= n; y++) bits[y].init(_nx);
  }

  T sum(int y, int x) {
    y = min(y, n);
    T s = 0;
    while (y > 0) {
      s += bits[y].sum(x);
      y -= (y & -y);
    }
    return s;
  }

  void add(int y, int x, T v) {
    if (y <= 0) return;
    while (y <= n) {
      bits[y].add(x, v);
      y += (y & -y);
    }
  }
};


/* global variables */

int cs[MAX_K], hs[MAX_K], qcs[MAX_QN];
vi avs[MAX_N], rvs[MAX_N + 1];
vpil qvs[MAX_N];
BIT<ll> bit;

/* subroutines */

/* main */

int main() {
  int n, k, qn;
  scanf("%d%d%d", &n, &k, &qn);

  for (int i = 0; i < k; i++) {
    int li, ri;
    scanf("%d%d%d%d", &li, &ri, cs + i, hs + i), li--;

    avs[li].push_back(i);
    rvs[ri].push_back(i);
  }

  for (int i = 0; i < qn; i++) {
    int iq;
    ll xq;
    scanf("%d%lld", &iq, &xq), iq--;

    qvs[iq].push_back(pil(i, xq));
  }

  bit.init(k);

  for (int i = 0; i < n; i++) {
    for (auto u: rvs[i]) bit.add(u + 1, -hs[u]);
    for (auto u: avs[i]) bit.add(u + 1, hs[u]);

    ll sum = bit.sum(k);
    //for (int j = 1; j <= k; j++)
    //printf("%lld%c", bit.sum(j), (j < k) ? ' ' : '\n');

    for (auto qx: qvs[i]) {
      int qi = qx.first;
      ll x = qx.second;

      qcs[qi] = -1;
      if (sum >= x) {
	int j = bit.lower_bound(x);
	//printf(" i=%d, x=%lld -> j=%d\n", i, x, j);
	if (j > 0) qcs[qi] = cs[j - 1];
      }
    }
  }

  for (int i = 0; i < qn; i++) printf("%d\n", qcs[i]);
  return 0;
}