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

#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define mp make_pair
#define mt make_tuple

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;

const int inf = 1e9;
const ll linf = 1e18;
const ll mod = 1e9 + 7;

int w, n, m;
vector<tuple<int, int, int>> g[202];
bool used[202];

int dfs(int v, int t, int f)
{
  if(v == t) return f;
  used[v] = true;

  for(auto &u : g[v]){
    int to, cap, rev;
    tie(to, cap, rev) = u;
    if(!used[to] and cap > 0){
      int ff = dfs(to, t, min(f, cap));
      if(ff > 0){
        get<1>(u) -= ff;
        get<1>(g[to][rev]) += ff;
        return ff;
      }
    }
  }

  return 0;
}

int maxflow(int s, int t)
{
  int flow = 0;
  while(1){
    memset(used, 0, sizeof(used));
    int f = dfs(s, t, inf);
    if(f == 0) return flow;
    flow += f;
  }
}

void add_edge(int from, int to, int cap)
{
  g[from].pb(mt(to, cap, g[to].size()));
  g[to].pb(mt(from, 0, g[from].size()-1));
}

int main()
{
  cin >> w >> n;

  repi(i, 1, n+1){
    add_edge(0, i, inf);

    int j;
    cin >> j;
    add_edge(i, i+50, j);
  }

  cin >> m;

  repi(i, 1, m+1){
    int c;
    cin >> c;
    add_edge(100+i, 150+i, c);
    add_edge(150+i, 201, inf);
  }

  repi(i, 1, m+1){
    int q;
    cin >> q;

    vi x(q);
    rep(j, q) cin >> x[j];

    int k = 0;
    repi(j, 1, n+1){
      if(j == x[k]) k++;
      else add_edge(50+j, 100+i, inf);
    }
  }

  if(maxflow(0, 201) >= w) cout << "SHIROBAKO" << endl;
  else cout << "BANSAKUTSUKITA" << endl;

  return 0;
}