import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(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-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

n, k, q = LI()
ij = LLI1(k)
ll, rr = [], []
for qi in range(q):
    l, r, x = LI()
    l -= 1
    x -= 1
    ll.append((l, qi))
    rr.append((r, x, qi))

def swap(i, j):
    p, q = pp[i], pp[j]
    pp[i], pp[j], p2i[p], p2i[q] = q, p, p2i[q], p2i[p]

ans = [0]*q
pp = list(range(n))
p2i = list(range(n))
rr.sort(key=lambda x: -x[0])
for t in range(k):
    while rr and rr[-1][0] == t:
        r, x, qi = rr.pop()
        ans[qi] = pp[x]
    i, j = ij[t]
    swap(i, j)
while rr:
    r, x, qi = rr.pop()
    ans[qi] = pp[x]

pp = list(range(n))
p2i = list(range(n))
ll.sort(key=lambda x: -x[0])
for t in range(k):
    while ll and ll[-1][0] == t:
        l, qi = ll.pop()
        ans[qi] = p2i[ans[qi]]+1
    i, j = ij[t]
    swap(i, j)

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