#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
struct edge { int to, cost, rev_e; };
vector<vector<edge>> vec(2000);
bool bo[2000] = { false };
int n, m, s, t;
int ans = 0;
int inf = 1000000007;
int dfs(int x, int y) {
	if (x == t) {
		return y;
	}
	bo[x] = true;
	for (int i = 0; i < vec[x].size(); i++) {
		edge now = vec[x][i];
		if (!bo[now.to] && now.cost > 0) {
			int d = dfs(now.to, min(y, now.cost));
			if (d > 0) {
				vec[x][i].cost -= d;
				vec[now.to][now.rev_e].cost += d;
				return d;
			}
		}
	}
	return 0;
}
int main() {
	int w;
	cin >> w;
	int n1;
	cin >> n1;
	for (int i = 1; i <= n1; i++) {
		int j;
		cin >> j;
		vec[0].emplace_back(edge{ i, inf, int(vec[i].size()) });
		vec[i].emplace_back(edge{ 0,0,int(vec[0].size() - 1) });
		vec[i].emplace_back(edge{ n1 + i, j, int(vec[n1 + i].size()) });
		vec[n1 + i].emplace_back(edge{ i,0,int(vec[i].size() - 1) });
	}
	int m1;
	cin >> m1;
	n = n1 * 2 + m1 * 2 + 2;
	s = 0, t = n1 * 2 + m1 * 2 + 1;
	for (int i = 1; i <= m1; i++) {
		int c;
		cin >> c;
		vec[2 * n1 + i].emplace_back(edge{ 2 * n1 + m1 + i, c, int(vec[2 * n1 + m1 + i].size()) });
		vec[2 * n1 + m1 + i].emplace_back(edge{ 2 * n1 + i,0,int(vec[2 * n1 + i].size() - 1) });
		vec[2 * n1 + m1 + i].emplace_back(edge{ 2 * n1 + 2 * m1 + 1, c, int(vec[2 * n1 + 2 * m1 + 1].size()) });
		vec[2 * n1 + 2 * m1 + 1].emplace_back(edge{ 2 * n1 + m1 + i,0,int(vec[2 * n1 + m1 + i].size() - 1) });
	}
	for (int i = 1; i <= m1; i++) {
		int q;
		cin >> q;
		bool bo1[200];
		for (int j = 1; j <= n1; j++) {
			bo1[j] = true;
		}
		for (int j = 0; j < q; j++) {
			int x;
			cin >> x;
			bo1[x] = false;
		}
		for (int j = 1; j <= n1; j++) {
			if (bo1[j]) {
				vec[n1 + j].emplace_back(edge{ 2 * n1 + i, inf, int(vec[2 * n1 + i].size()) });
				vec[2 * n1 + i].emplace_back(edge{ n1 + j,0,int(vec[n1 + j].size() - 1) });
			}
		}
	}
	while (1) {
		for (int i = 0; i < n; i++) {
			bo[i] = false;
		}
		int ans1 = dfs(s, 100000007);
		if (ans1 == 0) {
			break;
		}
		ans += ans1;
	}
	if (ans < w) {
		cout << "BANSAKUTSUKITA" << endl;
	}
	else {
		cout << "SHIROBAKO" << endl;
	}
}