#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
//---------------------------------------------------------------------------------------------------
template<class V> struct MaxFlow {
    struct edge { int to, reve; V cap; edge(int t, int r, V c) : to(t), reve(r), cap(c) {} };
    int MV; vector<vector<edge>> E; vector<int> itr, lev;
    MaxFlow() {} MaxFlow(int n) { init(n); }
    void init(int n) { MV = n; itr = vector<int>(MV), lev = vector<int>(MV); E = vector<vector<edge>>(MV); }
    void add_edge(int x, int y, V cap, bool undir = false) { E[x].push_back(edge(y, (int)E[y].size(), cap));
        E[y].push_back(edge(x, (int)E[x].size() - 1, undir ? cap : 0)); }
    void bfs(int cur) { rep(i, 0, MV) lev[i] = -1; queue<int> q; lev[cur] = 0; q.push(cur);
        while (q.size()) { int v = q.front(); q.pop();
        for(auto e : E[v]) if (e.cap>0 && lev[e.to]<0) lev[e.to] = lev[v] + 1, q.push(e.to); } }
    V dfs(int from, int to, V cf) { if (from == to) return cf;
        for (; itr[from]<E[from].size(); itr[from]++) {
            edge* e = &E[from][itr[from]]; if (e->cap>0 && lev[from]<lev[e->to]) { 
                V f = dfs(e->to, to, min(cf, e->cap));
                if (f>0) { e->cap -= f; E[e->to][e->reve].cap += f; return f; }
            } } return 0; }
    V maxflow(int from, int to) { V fl = 0, tf;
        while (1) { bfs(from); if (lev[to]<0) return fl;
            rep(i, 0, MV) itr[i] = 0; while ((tf = dfs(from, to, numeric_limits<V>::max()))>0) fl += tf; } }
};
/*---------------------------------------------------------------------------------------------------
　　　　　　　　　　　 ∧＿∧  
　　　　　 ∧＿∧ 　（´<_｀ ）　 Welcome to My Coding Space
　　　　 （ ´_ゝ`）　/　 ⌒i  
　　　　／　　　＼　 　　|　|  
　　　 /　　 /￣￣￣￣/　　|  
　 ＿_(__ﾆつ/　    ＿/ .| .|＿＿＿＿  
　 　　　＼/＿＿＿＿/　（u　⊃  
---------------------------------------------------------------------------------------------------*/







#define INF 10101010
int W, N, J[50], M, C[50], E[50][50];
//---------------------------------------------------------------------------------------------------
void _main() {
    cin >> W >> N;
    rep(i, 0, N) cin >> J[i];
    cin >> M;
    rep(i, 0, M) cin >> C[i];
    rep(i, 0, M) {
        int Q; cin >> Q;
        rep(q, 0, Q) {
            int X; cin >> X; X--;
            E[X][i] = 1;
        }
    }

    MaxFlow<int> mf(N + M + 2);

    rep(i, 0, N) mf.add_edge(N + M, i, J[i]);
    rep(a, 0, N) rep(b, 0, M) if (E[a][b] == 0) mf.add_edge(a, N + b, INF);
    rep(i, 0, M) mf.add_edge(i + N, N + M + 1, C[i]);

    int f = mf.maxflow(N + M, N + M + 1);
    if (W <= f) printf("SHIROBAKO\n");
    else printf("BANSAKUTSUKITA\n");
}