3.py

n, m = map(int, input().split())
mas = []
sumin = 0
sumout = 0
massorted = []
for i in range(n+m):
    f = input()
    ch = int(f[1:])
    if f[0] == '-':
        mas.append(ch)
        massorted.append(ch)
        sumout += ch
    else:
        massorted.sort(reverse=True)
        i = 0

        while sumin < sumout:
            sumout -= massorted[i]
            mas[mas.index(massorted[i])] = -1
            massorted[i] = -1
            i += 1
        for j in range(len(mas)):
            if mas[j] == -1:
                print('declined')
            else:
                print('approved')


        massorted = []
        mas = []
        sumin -= sumout
        sumout = 0
        print('resupplied')
        sumin += ch


massorted.sort(reverse=True)
i = 0


while sumin<sumout:
    sumout -= massorted[i]
    mas[mas.index(massorted[i])] = -1
    massorted[i] = -1
    i += 1
for j in range(len(mas)):
    if mas[j] == -1:
        print('declined')
    else:
        print('approved')