from collections import defaultdict,deque

W=int(input())
N=int(input())
J=list(map(int,input().split()))
M=int(input())
C=list(map(int,input().split()))
NO=[set(list(map(int,input().split()))[1:]) for i in range(M)]

# dinic法

V=N+M+2
start=0
goal=V-1

EDGE=[defaultdict(int) for i in range(V)]

for i in range(N):
    EDGE[start][i+1]=J[i]

for i in range(M):
    EDGE[N+1+i][goal]=C[i]

for i in range(N):
    for j in range(M):
        if i+1 in NO[j]:
            continue
        EDGE[i+1][N+1+j]=float("inf")

ANS=0
while True:
    # まずBFSする

    DIS=[-1]*V
    Q=deque([start])
    DIS[start]=0
    EDGE2=[[] for i in range(V)]

    while Q:
        x=Q.popleft()
        for to in EDGE[x]:
            if EDGE[x][to]==0:
                continue
            
            if DIS[to]==-1:
                DIS[to]=DIS[x]+1
                Q.append(to)
                EDGE2[x].append(to)
                
            elif DIS[to]==DIS[x]+1:
                EDGE2[x].append(to)

    if DIS[goal]==-1:
        break

    # BFSしたときのEDGEを使ってDFSする

    MINCOST=[float("inf")]*V
    NOW=start
    ROUTE=[-1]*V
    
    while NOW!=-1: # DFS

        cost=MINCOST[NOW]
        
        if NOW==goal:
            ANS+=cost
            i=goal
            
            while i!=start: # goalからたどり,Routeを使ってEDGEの更新
                j=ROUTE[i]
                if EDGE[j][i]==cost:
                    NOW=j
                    EDGE2[j].pop()
                
                EDGE[j][i]-=cost # 使ったルートをいけなく更新
                MINCOST[j]-=cost                
                EDGE[i][j]+=cost # 逆向きに進めるようにする.
                i=j
            continue

        if EDGE2[NOW]:
            to=EDGE2[NOW][-1]
            ROUTE[to]=NOW
            MINCOST[to]=min(cost,EDGE[NOW][to])
            NOW=to

        else:
            if NOW==start:
                break
            EDGE2[ROUTE[NOW]].pop()
            NOW=ROUTE[NOW]
            
if W<=ANS:
    print("SHIROBAKO")
else:
    print("BANSAKUTSUKITA")