// includes #include using namespace std; // macros #define pb emplace_back #define mk make_pair #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define rep(i, n) FOR(i, 0, n) #define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--) #define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr) #define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr) #define all(x) (x).begin(),(x).end() #define sz(x) ((int)(x).size()) #define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) #define bit(n) (1LL<<(n)) // functions template bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;} template bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;} template istream &operator>>(istream &is, vector &vec){for(auto &v: vec)is >> v; return is;} template ostream &operator<<(ostream &os, const vector& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;} template ostream &operator<<(ostream &os, const set& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template ostream &operator<<(ostream &os, const unordered_set& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template ostream &operator<<(ostream &os, const multiset& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template ostream &operator<<(ostream &os, const unordered_multiset& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template ostream &operator<<(ostream &os, const pair &p){os << p.first << " " << p.second; return os;} template ostream &operator<<(ostream &os, const map &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;} template ostream &operator<<(ostream &os, const unordered_map &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;} // types using ll = long long int; using P = pair; // constants const int inf = 1e9; const ll linf = 1LL << 50; const double EPS = 1e-10; const int mod = 1000000007; const int dx[4] = {-1, 0, 1, 0}; const int dy[4] = {0, -1, 0, 1}; // io struct fast_io{ fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);} } fast_io_; template struct edge {int to; T cap; int rev;}; template struct Graph{ int n; vector>> vec; vector level; vector iter; Graph(int n): n(n){ vec.resize(n); level.resize(n); iter.resize(n); } void adde(int at, int to, T cap){ vec[at].push_back((edge){to, cap, (int)vec[to].size()}); vec[to].push_back((edge){at, 0, (int)vec[at].size() - 1}); } void bfs(int s){ fill(level.begin(), level.end(), -1); level[s] = 0; queue q; q.push(s); while(!q.empty()){ auto p = q.front(); q.pop(); for(auto e: vec[p]){ if(level[e.to] < 0 && e.cap > 0){ level[e.to] = level[p] + 1; q.push(e.to); } } } } T dfs(int v, int t, T f){ if(v == t)return f; int st = iter[v]; for(int i = st; i < vec[v].size(); i++){ iter[v] = i; auto& e = vec[v][i]; if(level[v] < level[e.to] && e.cap > 0){ auto d = dfs(e.to, t, min(f, e.cap)); if(d > 0){ e.cap -= d; vec[e.to][e.rev].cap += d; return d; } } } return 0; } T max_flow(int s, int t){ T flow = 0; while(true){ bfs(s); if(level[t] < 0)return flow; fill(iter.begin(), iter.end(), 0); T inf = numeric_limits::max(); T f = dfs(s, t, inf); while(f > 0){ flow += f; f = dfs(s, t, inf); } } } T min_cut(int s, int t){ return max_flow(s, t); } }; using GraphI = Graph; using GraphL = Graph; bool ok[51][51]; int main(int argc, char const* argv[]) { int w; int n; cin >> w >> n; vector j(n); cin >> j; int m; cin >> m; vector c(m); cin >> c; rep(i, n){ rep(k, m)ok[i][k] = true; } rep(i, m){ int q; cin >> q; rep(k, q){ int x; cin >> x, x--; ok[x][i] = false; } } GraphL g(2 + n + m); rep(i, n){ g.adde(0, i + 1, j[i]); } rep(i, m){ g.adde(n + 1 + i, 1 + n + m, c[i]); } rep(i, n){ rep(k, m){ if(ok[i][k]){ g.adde(i + 1, 1 + n + k, inf); } } } auto f = g.min_cut(0, 1 + n + m); if(f >= w)cout << "SHIROBAKO" << endl; else cout << "BANSAKUTSUKITA" << endl; return 0; }