N,M,Q=map(int,input().split())

Dsdsd = list(map(int,input().split()))
Msdsd = list(map(int,input().split()))

neighbors = [[i] for i in range(N)]

for _ in range(M):
    f,t=map(int,input().split())
    neighbors[f-1].append(t-1)
    neighbors[t-1].append(f-1)

balance = [Msdsd[i] - Dsdsd[i] for i in range(N)]

balance_n = [0 for _ in range(N)]
for i in range(N):
    balance_n[i] = (0, sum(balance[j] for j in neighbors[i]))

n_adds = 0
for qi in range(Q):
    q=input().split()
    if q[0] == 'add':
        if q[2] == 'monitor':
            balance[int(q[3])-1] += int(q[1])
        else:
            balance[int(q[3])-1] -= int(q[1])
        n_adds += 1
    else:
        i=int(q[1])-1
        lq, bn = balance_n[i]
        if abs(bn) <= (n_adds - lq) * 100:
            balance_n[i] = (n_adds, sum(balance[j] for j in neighbors[i]))
        lq, bn = balance_n[i]
        if bn == 0:
            print('same')
        elif bn < 0:
            print('desks')
        else:
            print('monitors')