import sys
input = sys.stdin.readline

#先頭からのsum,addをO(logN)
class Fenwick_Tree:
    def __init__(self, n):
        self._n = n  # 要素数
        self.data = [0] * n
        self.depth = n.bit_length()

    def add(self, p, x):
        assert 0 <= p < self._n
        p += 1  # 0-indexed -> 1-indexed
        while p <= self._n:
            self.data[p - 1] += x # dataを更新
            p += p & -p  # pにLSB(p)を加算,data[i]の長さを示す
    
    def _sum(self, r):#s = a0+a1+...+a[r-1] or 0
        s = 0  # 総和を入れる変数
        while r > 0:
            s += self.data[r - 1]
            r -= r & -r  # rからLSB(r)を減算
        return s
    
    def sum(self, l, r):#[l,r)の総和
        assert 0 <= l <= r <= self._n
        return self._sum(r) - self._sum(l)

    def bisect_l(self,x): #wa >= xとなる最小のidx
        pos = 0 ; wa = 0
        for i in range(self.depth+1,-1,-1):
            k = pos + (1<<i)
            if k <= self._n and wa + self.data[k-1] < x:
                wa += self.data[k-1]
                pos += (1<<i)
        return pos 
    
    def bisect_r(self,x): #wa >= xとなる最大のidx
        if x < 0 : return 0
        pos = 0 ; wa = 0
        for i in range(self.depth+1,-1,-1):
            k = pos + (1 << i)
            if k <= self._n and wa + self.data[k-1] <= x:
                wa += self.data[k-1]
                pos += (1<<i)
        return pos

n,k,q = map(int,input().split())
lrch = [list(map(int,input().split())) for _ in range(k)]
ix = [list(map(int,input().split())) for _ in range(q)]

Q = [[] for _ in range(n+2)]
for idx , (l,_,_,h) in enumerate(lrch):
    Q[l].append([True,h,idx])
for ans_idx , (i,x) in enumerate(ix):
    Q[i].append([False,ans_idx,x])
for idx , (_,r,_,h) in enumerate(lrch):
    Q[r].append([True,-h,idx])


ans = [-1] * q
fw = Fenwick_Tree(k+2)
for i in range(n+2):
    for boo,x,y in Q[i]:
        if boo : fw.add(y,x)
        else :
            idx = fw.bisect_l(y)
            if idx >= k : continue
            ans[x] = lrch[idx][2]

print(*ans,sep="\n")