#include "bits/stdc++.h"
using namespace std;

struct edge {
        int to, cap, rev;
};
bool used[101010];
vector<edge> g[101010];
static const int INF = 0x3f3f3f3f;
void add_edge(int from, int to, int cap) {
        g[from].push_back((edge) { to, cap, (int)g[to].size() });
        g[to].push_back((edge) { from, 0, (int)g[from].size() - 1 });
        //cout << "from to cap " << from << ' ' << to << ' ' << cap << endl;
}
int dfs(int v, int t, int f) {
        if (v == t) return f;
        used[v] = true;
        for (int i = 0; i < g[v].size(); i ++) {
                edge& e = g[v][i];
                if (!used[e.to] && e.cap > 0) {
                        int d = dfs(e.to, t, min(f, e.cap));
                        if (d > 0) {
                                e.cap -= d;
                                g[e.to][e.rev].cap += d;
                                return  d;
                        }
                }
        }
        return 0;
}
int MaxFlow(int s, int t) {
        int flow = 0;
        while (true) {
                memset(used, false, sizeof(used));
                int f = dfs(s, t, INF);
                if (f == 0) return flow;
                flow += f;
        }
}

int main() {
        int w;
        cin >> w;
        int n;
        cin >> n;
        vector<int> jj(n);
        for (int i = 0; i < n; i ++) cin >> jj[i];
        int m;
        cin >> m;
        vector<int> c(m);
        for (int i = 0; i < m; i ++) cin >> c[i];
        int s = n + m, t = n + m + 1;
        for (int i = 0; i < n; i ++) add_edge(s, i, jj[i]);
        for (int i = 0; i < m; i ++) add_edge(n + i, t, c[i]);
        for (int i = 0; i < m; i ++) {
                int q;
                cin >> q;
                vector<bool> can(n, true);
                for (int j = 0; j < q; j ++) {
                        int x;
                        cin >> x;
                        x --;
                        can[x] = false;
                }
                for (int j = 0; j < n; j ++) {
                        if (can[j]) {
                                add_edge(j, n + i, INF);
                        }
                }
        }
        //cerr << "s = " << s << " t = " << t << endl;
        if (MaxFlow(s, t) < w) cout << "BANSAKUTSUKITA" << endl;
        else cout << "SHIROBAKO" << endl;
        return 0;
}