#include "bits/stdc++.h"
using namespace std;

const int maxnodes = 5000;

int nodes = maxnodes, src, dest;
int dist[maxnodes], q[maxnodes], work[maxnodes];

struct Edge {
	int to, rev;
	int f, cap;
};

vector<Edge> g[maxnodes];

// Adds bidirectional edge
void addEdge(int s, int t, int cap){
	Edge a = { t, g[t].size(), 0, cap };
	Edge b = { s, g[s].size(), 0, cap };
	g[s].push_back(a);
	g[t].push_back(b);
}

bool dinic_bfs() {
	fill(dist, dist + nodes, -1);
	dist[src] = 0;
	int qt = 0;
	q[qt++] = src;
	for (int qh = 0; qh < qt; qh++) {
		int u = q[qh];
		for (int j = 0; j < (int)g[u].size(); j++) {
			Edge &e = g[u][j];
			int v = e.to;
			if (dist[v] < 0 && e.f < e.cap) {
				dist[v] = dist[u] + 1;
				q[qt++] = v;
			}
		}
	}
	return dist[dest] >= 0;
}

int dinic_dfs(int u, int f) {
	if (u == dest)
		return f;
	for (int &i = work[u]; i < (int)g[u].size(); i++) {
		Edge &e = g[u][i];
		if (e.cap <= e.f) continue;
		int v = e.to;
		if (dist[v] == dist[u] + 1) {
			int df = dinic_dfs(v, min(f, e.cap - e.f));
			if (df > 0) {
				e.f += df;
				g[v][e.rev].f -= df;
				return df;
			}
		}
	}
	return 0;
}


int maxFlow(int _src, int _dest) {
	src = _src;
	dest = _dest;
	int result = 0;
	while (dinic_bfs()) {
		fill(work, work + nodes, 0);
		while (int delta = dinic_dfs(src, INT_MAX))
			result += delta;
	}
	return result;
}


int main() {
	int W;
	cin >> W;
	int N , M;
	cin >> N;
	vector<int> v(N);
	for (int i = 0; i < N; i++)
	{
		cin >> v[i];
	}
	cin >> M;

	nodes = N + M + 2;
	for (int i = 0; i < N; i++)
	{
		addEdge(N + M, i, v[i]);
	}

	for (int i = 0; i < M; i++)
	{
		int C;
		cin >> C;
		addEdge(N + i, N + M + 1, C);
	}

	for (int i = 0; i < M; i++)
	{
		int Q;
		cin >> Q;
		set<int> s;
		for (int j = 0; j < Q; j++)
		{
			int temp;
			cin >> temp;
			temp--;
			s.insert(temp);
		}
		for (int j = 0; j < N; j++)
		{
			if (s.find(j) != s.end()) continue;
			addEdge(j, N + i, 9999999);
		}
	}

	int flow = maxFlow(N + M, N + M + 1);
	if (flow >= W) cout << "SHIROBAKO" << endl;
	else cout << "BANSAKUTSUKITA" << endl;
}