#include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <math.h>
#include <cassert>
#include <bitset>
#include <map>
#include <algorithm>
#include <iterator>
#include <string>
#include <utility>
#include <numeric>
#include <regex>
#include <complex>
#include <atcoder/all>
using namespace atcoder;
using namespace std;
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>
ostream &operator<<(ostream &os,const pair<T1,T2>&p){
  os<<p.first<<" "<<p.second;
  return os;
}
template<typename T1,typename T2>
istream &operator>>(istream &is,pair<T1,T2>&p){
  is>>p.first>>p.second;
  return is;
}
template<typename T>
istream &operator>>(istream &is,vector<T> &a){
  for(auto &i:a)is>>i;
  return is;
}
#define reps(i,a,n) for(int i=(a);i<(n);i++)
#define rep(i,n) reps(i,0,n)
#define all(x) x.begin(),x.end()
ll myceil(ll a,ll b){return (a+b-1)/b;}
int main(){
  int w,n,m;
  cin>>w>>n;
  vector<int>a(n);
  cin>>a;
  cin>>m;
  mf_graph<int>g(n+m+2);
  rep(i,n)g.add_edge(n+m,i,a[i]);
  rep(i,m){
    int c;
    cin>>c;
    g.add_edge(i+n,n+m+1,c);
  }
  vector<vector<bool>>f(n,vector<bool>(m,true));
  rep(i,m){
    int q;
    cin>>q;
    rep(j,q){
      int x;
      cin>>x;
      x--;
      f[x][i]=false;
    }
  }
  rep(i,n)rep(j,m)if(f[i][j]){
    g.add_edge(i,j+n,1000000000);
  }
  if(g.flow(n+m,n+m+1)>=w)cout<<"SHIROBAKO"<<endl;
  else cout<<"BANSAKUTSUKITA"<<endl;
}