#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

struct flow_network {
	int n;
	struct edge { int v; ll c; int rev; };
	vector< vector<edge> > G;
	flow_network(int _n) : n(_n), G(_n) {}
	void add_edge(int u, int v, ll c) {
		edge e = {v, c, G[v].size()}, _e = {u, 0, G[u].size()};
		G[u].push_back(e); G[v].push_back(_e);
	}
	ll dfs(int u, int t, ll f, vector<bool>& vis) {
		if (u == t) return f;
		vis[u] = true;
		for (int i = 0; i < G[u].size(); i++) {
			edge& e = G[u][i];
			if (vis[e.v] || e.c == 0) continue;
			ll d = min(e.c, dfs(e.v, t, min(f, e.c), vis));
			if (d == 0) continue;
			e.c -= d;
			G[e.v][e.rev].c += d;
			return d;
		}
		return 0;
	}
	ll max_flow(int s, int t) {
		ll res = 0;
		for (;;) {
			vector<bool> vis(n);
			ll f = dfs(s, t, LLONG_MAX, vis);
			if (f == 0) return res;
			res += f;
		}
	}
};

int main() {
	int W; cin >> W;
	int N; cin >> N;
	vector<int> J(N);
	for (int i = 0; i < N; i++)
		cin >> J[i];
	int M; cin >> M;
	vector<int> C(M);
	for (int j = 0; j < M; j++)
		cin >> C[j];
	vector<set<int> > X(M);
	for (int j = 0; j < M; j++) {
		int Q; cin >> Q;
		while (Q--) {
			int x; cin >> x;
			X[j].insert(x - 1);
		}
	}
	flow_network fn(N + M + 3);
	int s = N + M, t = N + M + 1, ss = N + M + 2;
	for (int i = 0; i < N; i++)
		fn.add_edge(s, i, J[i]);
	for (int j = 0; j < M; j++)
		fn.add_edge(N + j, t, C[j]);
	for (int j = 0; j < M; j++)
		for (int i = 0; i < N; i++) {
			if (X[j].count(i)) continue;
			fn.add_edge(i, N + j, 10000);
		}
	fn.add_edge(ss, s, W);
	int x = fn.max_flow(ss, t);
	cout << (x == W ? "SHIROBAKO" : "BANSAKUTSUKITA") << endl;
}