import sys
from heapq import heapify, heappush, heappop
from collections import deque
N = 8
loop = 1000
dl = 10
cl = 6
l = 0
def solve():
ans = deque([])
for lp in range(loop):
# Input
D, T = map(int, input().split())
C = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
# 出力すべきものが残ってるなら出力する
if ans:
print(ans.popleft(), flush=True)
continue
# Process
# まず小さいバケツを探して置き換える
flag1 = False
for i in range(l, N):
if C[i] < cl:
print('change {}'.format(i + 1), flush=True)
flag1 = True
break
if flag1:
continue
# 全てcl以上になったら売りフェーズに入る
flag2 = False
if D < dl:
for i in range(N):
if A[i] == 0:
print('fill {}'.format(i + 1), flush=True)
flag2 = True
break
else:
print('pass', flush=True)
flag2 = True
else:
num_n, need, cmb = canmake(D, T, C, A)
if need is not None:
for i in need:
ans.append('fill {}'.format(i + 1))
selw = 'sell {}'.format(len(cmb))
for c in cmb:
selw += ' ' + str(c + 1)
ans.append(selw)
print(ans.popleft(), flush=True)
flag2 = True
else:
print('pass', flush=True)
flag2 = True
if flag2:
continue
def canmake(D, T, C, A):
uni = 2**N
res = None
max_fill = 10
num_need = 10
res_cmb = []
for cmd in range(uni):
val = 0
restmp = []
cmbtmp = []
numtmp = 0
for i in range(N):
if cmd & (1 << i):
val += C[i]
numtmp += 1
cmbtmp.append(i)
if A[i] != C[i]:
restmp.append(i)
if val == D and len(restmp) < max_fill:
num_need = numtmp
max_fill = len(restmp)
res = restmp[:]
res_cmb = cmbtmp[:]
if max_fill + 1 < T:
return numtmp, res, res_cmb
else:
return None, None, None
def debug(x, table):
for name, val in table.items():
if x is val:
print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)
return None
if __name__ == '__main__':
solve()