#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

struct FlowEdge{
    int to, cap, rev;
    FlowEdge(int to_, int cap_, int rev_):to(to_),cap(cap_),rev(rev_){ }
};
class FordFulkerson{
public:
    FordFulkerson(){}

    FordFulkerson(int n) : G(n), used(n){}

    void add(int from, int to, int cap){
        G[from].emplace_back(to, cap, (int)G[to].size() );
        G[to].emplace_back(from, 0, (int)G[from].size() - 1 );
    }

    int get(int s, int t){
        int f = 1, res = 0;
        while (f){
            fill(begin(used), end(used), false);
            f = dfs(s, t, INT_MAX);
            res += f;
        }
        return res;
    }
private:

    vector<vector<FlowEdge>> G;
    vector<bool> used;

    int dfs(int v, int t, int f){
        if (v == t) return f;
        used[v] = 1;
        for (auto &e : G[v]){
            if (!used[e.to] && e.cap > 0){
                int d = dfs(e.to, t, min(e.cap, f));
                if (d > 0){
                    e.cap -= d;
                    G[e.to][e.rev].cap += d;
                    return d;
                }
            }
        }
        return 0;
    }
};

int ne[50][50];

int main(){
    int W, N;
    cin >> W >> N;
    vi J(N);
    rep(i, N)cin >> J[i];
    int M;
    cin >> M;
    vi C(M);
    rep(i, M)cin >> C[i];

    rep(i, M){
        int Q; cin >> Q;
        while(Q--){
            int X;
            scanf("%d", &X);
            ne[X - 1][i] = 1;
        }
    }

    const int source = 0, sink = 1, offN = 2, offM = N + 2;
    const int V = N + M + 2;
    FordFulkerson maxFlow(V);
    for(int i = 0; i < N; ++i){
        maxFlow.add(source, i + offN, J[i]);
    }
    for(int i = 0; i < M; ++i){
        maxFlow.add(i + offM, sink, C[i]);
    }
    rep(i, N)rep(j, M){
        if(!ne[i][j]){
            maxFlow.add(i + offN, j + offM, W);
        }
    }

    int mf = maxFlow.get(source, sink);
    puts(mf >= W ? "SHIROBAKO" : "BANSAKUTSUKITA");
}