#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <cstring>
using namespace std;

#define MAX_V 102
#define INF 10001
typedef long long ll;

//最初カット
//Dinic法

int W,N,M;

struct edge { int to, cap, rev; };

vector<edge> G[MAX_V];
int level[MAX_V];
int iter[MAX_V];

void add_edge(int from, int to, int cap) {
	G[from].push_back({ to, cap, (int)G[to].size() });
	G[to].push_back({ from, 0, (int)G[from].size() - 1 });
}

void bfs(int s) {
	memset(level, -1, sizeof(level));
	queue<int> que;
	level[s] = 0;
	que.push(s);
	while (!que.empty()) {
		int v = que.front(); que.pop();
		for (int i = 0; i < G[v].size(); i++) {
			edge &e = G[v][i];
			if (e.cap > 0 && level[e.to] < 0) {
				level[e.to] = level[v] + 1;
				que.push(e.to);
			}
		}
	}
}

int dfs(int v, int t, int f) {
	if (v == t) return f;
	for (int &i = iter[v]; i < G[v].size(); i++) {
		edge &e = G[v][i];
		if (e.cap > 0 && level[v] < level[e.to]) {
			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;
	while(1){
		bfs(s);
		if (level[t] < 0)return flow;
		memset(iter, 0, sizeof(iter));
		int f;
		while ((f = dfs(s, t, INF)) > 0) flow += f;
	}
}

int main()
{
	cin >> W >> N;
	for (int i = 0; i < N; i++) {
		int j;
		cin >> j;
		add_edge(0, i + 1, j);
	}
	cin >> M;
	for (int i = 0; i < M; i++) {
		int c;
		cin >> c;
		add_edge(i + 51, 101, c);
	}

	for (int i = 0; i < M; i++) {
		int Q;
		cin >> Q;
		vector<bool>X(N);
		for (int k = 0; k < Q; k++) {
			int x;
			cin >> x;
			X[x - 1] = true;
		}
		for (int k = 0; k < N; k++) {
			if(!X[k]) add_edge(k+1, i + 51, INF);
		}
	}

	int ans = max_flow(0, 101);

	if (ans >= W)cout << "SHIROBAKO" << endl;
	else cout << "BANSAKUTSUKITA" << endl;

    return 0;
}