# input
import sys
input = sys.stdin.readline
II = lambda : int(input())
MI = lambda : map(int, input().split())
LI = lambda : [int(a) for a in input().split()]
SI = lambda : input().rstrip()
LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)]
LSI = lambda n : [input().rstrip() for _ in range(n)]
MI_1 = lambda : map(lambda x:int(x)-1, input().split())
LI_1 = lambda : [int(a)-1 for a in input().split()]

mod = 998244353
inf = 1001001001001001001
ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97
ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97
yes = lambda : print("Yes")
no = lambda : print("No")
yn = lambda flag : print("Yes" if flag else "No")

prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1)
alplow = "abcdefghijklmnopqrstuvwxyz"
alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}
DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]]
DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]
DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]]
prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59]
sys.set_int_max_str_digits(0)
# sys.setrecursionlimit(10**6)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')

from collections import defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
DD = defaultdict
BSL = bisect_left
BSR = bisect_right

"""
swap が m 個与えられて、これを前から処理した時の最終的な A_x の値は？
前計算 + ダブリング？
"""

n, m, q = MI()

l = [0] * m
r = [0] * m
for i in range(m):
    l[i], r[i] = MI()
    l[i] -= 1
    r[i] -= 1

cyc = [0] * q
qry = [[] for i in range(m)] # ここで処理
for i in range(q):
    t, x = MI()
    cyc[i], r2 = divmod(t, m)
    qry[r2].append((i, x-1))


a = list(range(n)) # やさしい！

tmp = [0] * q # ここを答える
for i in range(m):
    for idx, x in qry[i]:
        tmp[idx] = a[x]
    a[l[i]], a[r[i]] = a[r[i]], a[l[i]]

jump = [a]
log = 60

for i in range(log):
    p = jump[-1]
    jump.append([p[p[x]] for x in range(n)])

for i in range(q):
    x = tmp[i]
    c = cyc[i]
    
    k = 0
    while c:
        if c & 1:
            x = jump[k][x]
        c >>= 1
        k += 1
    
    print(x + 1)