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].add(t-1)
    neighbors[t-1].add(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]))

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