#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;

#define MAX_V 1010

struct edge{int to,cap,rev;};

vector <edge> G[MAX_V];
bool used[MAX_V];

void add_edge(int from, int to, int cap){
  G[from].pb((edge){to,cap,sz(G[to])});
  G[to].pb((edge){from,0,sz(G[from])-1});
}


int dfs(int v,int t,int f){
  if(v == t){
    return f;
  }
  used[v] = true;
  rep(i,sz(G[v])){
    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 max_flow(int s,int t,int lim = INF){
  int flow = 0;
  for(;lim > 0;){
    mem(used,0);
    int f = dfs(s,t,lim);
    if(f == 0){
      break;
    }
    flow += f;
    lim -= f;
  }
  return flow;
}




int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  int W,N,M;
  cin >> W;
  cin >> N;

  // 0 -> 1 ~ N 
  
  rep2(i,1,N+1){
    int j;
    cin >> j;
    add_edge(0,i,j);
  }

  cin >> M;

  
  const int final = 450;

  rep2(i,1,M+1){
    int c;
    cin >> c;
    add_edge(200+i,final,c);
  }
  bool no_edge[55];
  rep2(i,1,M+1){
    mem(no_edge,0);
    int Q;
    cin >> Q;
    rep(i,Q){
      int x;
      cin >> x;
      no_edge[x] = true;
    }
    for (int j = 1; j <= N; j++) {
      if(!no_edge[j]){
        add_edge(j,200+i,W);
      }
    }
  }
  
  int now_w = max_flow(0,final);
  DEBUG1(now_w);
  
  if(now_w >= W){
    cout << "SHIROBAKO" << endl;
  }else{
    cout << "BANSAKUTSUKITA" << endl;
  }
  
  return 0;
}