#include <bits/stdc++.h>
using namespace std;
template <class F> class y_combinator {
    F f;

   public:
    y_combinator(F&& f) : f(std::forward<F>(f)) {}
    template <class... Args> auto operator()(Args&&... args) const { return f(*this, std::forward<Args>(args)...); }
};
using ll = long long;
using ld = long double;
template <class T, class U = std::less<T>> using prique = std::priority_queue<T, std::vector<T>, U>;
template <class T> T floor(T a, T b) noexcept { return a / b - (a % b && (a ^ b) < 0); }
template <class T> T ceil(T a, T b) noexcept { return floor(a + b - 1, b); }
template <class T> bool chmin(T& x, const T& y) noexcept { return (x > y ? x = y, true : false); }
template <class T> bool chmax(T& x, const T& y) noexcept { return (x < y ? x = y, true : false); }
#define overload4(a, b, c, d, e, ...) e
#define rep1(a) for (long long _i = 0; _i < (a); _i++)
#define rep2(i, a) for (long long i = 0; i < (a); i++)
#define rep3(i, a, b) for (long long i = (a); i < (b); i++)
#define rep4(i, a, b, c) for (long long i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i, a, b, c) for (long long i = (a); i > (b); i += (c))
#define all(x) std::begin(x), std::end(x)
#define rall(x) std::rbegin(x), std::rend(x)
#define pb push_back
#ifndef LOCAL
#define debug(...)
#endif

#include <atcoder/maxflow>
void run_case() {
    int W;
    cin >> W;
    int N;
    cin >> N;
    vector<int> J(N);
    rep(i, N) cin >> J[i];
    int M;
    cin >> M;
    vector<int> C(M);
    rep(i, M) cin >> C[i];
    vector<int> Q(M);
    vector<set<int>> X(M);
    rep(i, M) {
        cin >> Q[i];
        rep(Q[i]) {
            int x;
            cin >> x;
            X[i].insert(--x);
        }
    }
    const int SRC = N + M;
    const int SNK = N + M + 1;
    atcoder::mf_graph<ll> G(N + M + 2);
    rep(i, N) {
        G.add_edge(SRC, i, J[i]);
    }
    const ll INF = 1e18;
    rep(j, M) {
        rep(i, N) {
            if (X[j].count(i)) {
                G.add_edge(i, j + N, 0);
            } else {
                G.add_edge(i, j + N, INF);
            }
        }
        G.add_edge(j + N, SNK, C[j]);
    }
    cout << (G.flow(SRC, SNK) >= W ? "SHIROBAKO\n" : "BANSAKUTSUKITA\n");
}
int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::fixed(std::cout).precision(16);
    int T = 1;
    while (T--) run_case();
    return 0;
}