#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define pb(a) push_back(a)
#define pr(a) cout<<(a)<<endl
#define PR(a,b) cout<<(a)<<" "<<(b)<<endl
#define R cin>>
#define F first
#define S second
#define ll long long
bool check(int n,int m,int x,int y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;

const int MAX_V=110;

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].push_back((edge){to,cap,G[to].size()});
  G[to].push_back((edge){from,0,G[from].size()-1});
}

int dfs(int v,int t,int f) {
  if(v==t) return f;
  used[v]=true;
  rep(i,G[v].size()) {
    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 flow=0;
  for(;;) {
    memset(used,0,sizeof(used));
    int f=dfs(s,t,MAX);
    if(f==0) return flow;
    flow+=f;
  }
}

int main() {
  int w,n;
  cin >> w >> n;
  int a[n];
  rep(i,n) {
    cin >> a[i];
    add_edge(0,i+1,a[i]);
  }
  int m;
  cin >> m;
  int c[m];
  rep(i,m) cin >> c[i];
  rep(i,m) {
    int q;
    cin >> q;
    bool u[n+1];
    memset(u,0,sizeof(u));
    rep(j,q) {
      int x;
      cin >> x;
      u[x-1]=true;
    }
    rep(j,n) {
      if(!u[j]) add_edge(j+1,55+i,a[j]);
    }
    add_edge(55+i,105,c[i]);
  }
  if(max_flow(0,105)>=w) cout << "SHIROBAKO" << endl;
  else cout << "BANSAKUTSUKITA" << endl;
  return 0;
}