#include <bits/stdc++.h>

using namespace std;

namespace {

    typedef double real;
    typedef long long ll;

    template<class T> ostream& operator<<(ostream& os, const vector<T>& vs) {
        if (vs.empty()) return os << "[]";
        os << "[" << vs[0];
        for (int i = 1; i < vs.size(); i++) os << " " << vs[i];
        return os << "]";
    }
    template<class T> istream& operator>>(istream& is, vector<T>& vs) {
        for (auto it = vs.begin(); it != vs.end(); it++) is >> *it;
        return is;
    }

    struct Edge {
        int from, to, cap, rev;
        Edge() {}
        Edge(int from, int to, int cap, int rev) : from(from), to(to), cap(cap), rev(rev) {}
    };
    int V;
    vector< vector<Edge> > G;
    vector<bool> used;
    void init() {
        G.clear(); G.resize(V);
        used.clear(); used.resize(V);
    }
    void addEdge(int from, int to, int cap) {
        //cout << from << " " << to << " : " << cap << endl;
        G[from].push_back(Edge(from, to, cap, G[to].size()));
        G[to].push_back(Edge(to, from, 0, int(G[from].size()) - 1));
    }
    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 calc(int s, int t) {
        int flow = 0;
        while (true) {
            fill(used.begin(), used.end(), false);
            int f = dfs(s, t, 1e9);
            if (f == 0) return flow;
            flow += f;
        }
    }

    const int INF = 1<<28;

    void solve() {
        int W; cin >> W;
        int N; cin >> N;
        vector<int> J(N); cin >> J;
        int M; cin >> M;
        vector<int> C(M); cin >> C;
        V = 2 + N + M; init();
        for (int i = 0; i < N; i++) addEdge(0, 1 + i, J[i]);
        for (int i = 0; i < M; i++) addEdge(1 + N + i, 1 + N + M, C[i]);
        for (int i = 0; i < M; i++) {
            vector<int> ng(N, false);
            int Q; cin >> Q;
            for (int j = 0; j < Q; j++) {
                int k; cin >> k; k--;
                ng[k] = true;
            }
            for (int j = 0; j < N; j++) {
                if (ng[j]) continue;
                addEdge(1 + j, 1 + N + i, INF);
            }
        }
        cout << (calc(0, 1 + N + M) >= W ? "SHIROBAKO" : "BANSAKUTSUKITA") << endl;
    }
}

int main() {
    solve();
    return 0;
}