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

/*^ debug  */

template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string) s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) { res += ", "; }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) { res += static_cast<char>('0' + v[i]); }
  return res;
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) { res += ", "; }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) { return "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; }
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) { return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")"; }
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) { return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")"; }
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << " " << to_string(H); debug_out(T...); }
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

/*  debug $*/

/*^ vector extensions  */

template<typename T>
T concat(initializer_list<T> lists) {
  T a;
  for (auto &l : lists) a.insert(a.end(), l.begin(), l.end());
  return a;
}

template<typename T, size_t sz>
struct _Matrix_type { typedef vector<typename _Matrix_type<T, sz - 1>::type> type; };
template<typename T>
struct _Matrix_type<T, 1> { typedef T type; };
template<typename T>
struct _Matrix {
  static auto build(size_t s) { return vector<T>(s); }
  template<typename ...Args>
  static auto build(size_t f, Args... args) {
    return vector<typename _Matrix_type<T, 1 + sizeof...(args)>::type>(f, _Matrix<T>::build(args...));
  }
};
template<typename T, typename... Args>
auto buildMatrix(Args... args) { return _Matrix<T>::build(args...); }

/*  vector extensions $*/

/*^ generic definitions  */

template<typename F>
struct _RecurFun : F {
  _RecurFun(F&& f) : F(forward<F>(f)) {}
  template<typename... Args>
  decltype(auto) operator()(Args&&... args) const { return F::operator()(*this, forward<Args>(args)...); }
};
template<typename F>
decltype(auto) RecurFun(F&& f) { return _RecurFun<F> { forward<F>(f) }; }

/*  generic definitions $*/

template<typename T = int, T INF = 0x3f3f3f3f>
struct EKarp {
  int n;
  vector<vector<T>> capacity;
  vector<vector<int>> adj;

  EKarp(int _n) : n(_n), capacity(_n, vector<T>(_n)), adj(_n) {}

  void addEdge(T w, int u, int v) {
    adj[u].push_back(v);
    adj[v].push_back(u);
    capacity[u][v] += w;
  }

  T bfs(int s, int t, vector<int> &parent) {
    fill(parent.begin(), parent.end(), -1);
    parent[s] = -2;
    queue<pair<int, int>> que;
    que.push({ s, INF });
    while (que.size()) {
      auto [cur, flow] = que.front();
      que.pop();
      for (int nxt : adj[cur]) {
        if (parent[nxt] == -1 && capacity[cur][nxt]) {
          parent[nxt] = cur;
          T nflow = min(flow, capacity[cur][nxt]);
          if (nxt == t) return nflow;
          que.push({ nxt, nflow });
        }
      }
    }
    return (T) 0;
  }

  T maxflow(int s, int t) {
    T flow = 0;
    vector<int> parent(n);
    T nflow;
    while (nflow = bfs(s, t, parent)) {
      if ((flow += nflow) >= INF) return flow;
      int cur = t;
      while (cur != s) {
        int pre = parent[cur];
        capacity[pre][cur] -= nflow;
        capacity[cur][pre] += nflow;
        cur = pre;
      }
    }
    return flow;
  }
};

int main() {
  ios::sync_with_stdio(false);

  int W; { cin >> W; }

  int N; { cin >> N; }

  vector<int> J(N); {
    for (int i = 0; i < N; ++i) cin >> J[i];
  }

  int M; { cin >> M; }

  vector<int> C(M); {
    for (int i = 0; i < M; ++i) cin >> C[i];
  }

  const int INF = 0x3f3f3f3f;

  EKarp<int, INF> ekarp(N + M + 2); {
    for (int i = 0; i < N; ++i) ekarp.addEdge(J[i], N + M, i);

    for (int i = 0; i < M; ++i) ekarp.addEdge(C[i], N + i, N + M + 1);

    for (int i = 0; i < M; ++i) {
      int Q; { cin >> Q; }

      vector<int> ng(N); {
        for (int j = 0; j < Q; ++j) {
          int X; { cin >> X, --X; }
          ng[X] = 1;
        }
      }

      for (int j = 0; j < N; ++j) if (!ng[j]) {
        ekarp.addEdge(INF, j, N + i);
      }
    }
  }

  int res = ekarp.maxflow(N + M, N + M + 1);
  cout << (res >= W ? "SHIROBAKO" : "BANSAKUTSUKITA") << endl;
}