import sys # sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() # dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = (1 << 63)-1 # inf = (1 << 31)-1 # md = 10**9+7 md = 998244353 class BitSum: def __init__(self, n): self.n = n+1 self.table = [0]*self.n def add(self, i, x): i += 1 while i < self.n: self.table[i] += x i += i & -i # [0,i]の和 def sum(self, i): i += 1 res = 0 while i > 0: res += self.table[i] i -= i & -i return res # [l,r)の和 def sumlr(self, l, r): if l >= r: return 0 if l == 0: return self.sum(r-1) return self.sum(r-1)-self.sum(l-1) # 数列を度数分布とみたときに、x番目がどのインデックスにあるかを返す # xが大きすぎるときは配列の長さnを返す def rank(self, x): idx = 0 d = 1 << (self.n-1).bit_length()-1 while d: if idx+d < self.n and self.table[idx+d] < x: x -= self.table[idx+d] idx |= d d >>= 1 return idx n, k, q = LI() dd = [[] for _ in range(n)] cc = [] for j in range(k): l, r, c, h = LI() l -= 1 dd[l].append((j, h)) dd[r].append((j, -h)) cc.append(c) xx = [[] for _ in range(n)] for qi in range(q): i, x = LI() i -= 1 xx[i].append((qi, x)) ans = [-1]*q bit = BitSum(n) for i in range(n): for j, d in dd[i]: bit.add(j, d) for qi, x in xx[i]: j = bit.rank(x) if j < k: ans[qi] = cc[j] print(*ans, sep="\n")