// Standard I/O
#include <iostream>
#include <sstream>
#include <cstdio>
// Standard Library
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>
// Template Class
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
// Container Control
#include <algorithm>

using namespace std;

#define rep( i, n ) for( int i = 0; i < n; ++i )
#define irep( i, n ) for( int i = n-1; i >= 0; --i )
#define reep( i, s, n ) for ( int i = s; i < n; ++i )
#define ireep( i, n, s ) for ( int i = n-1; i >= s; --i )
#define foreach(itr, x) for( typeof(x.begin()) itr = x.begin(); itr != x.end(); ++itr)

#define mp( a, b ) make_pair( a, b )
#define pb( a ) push_back( a )
#define all( v ) v.begin(), v.end()
#define fs first
#define sc second
#define vc vector

// for visualizer.html
double SCALE = 1.0;
double OFFSET_X = 0.0;
double OFFSET_Y = 0.0;
#define LINE(x,y,a,b) cerr << "line(" << SCALE*(x) + OFFSET_X << ","	\
	<< SCALE*(y) + OFFSET_Y << ","										\
	<< SCALE*(a) + OFFSET_X << ","										\
	<< SCALE*(b) + OFFSET_Y << ")" << endl;
#define CIRCLE(x,y,r) cerr << "circle(" << SCALE*(x) + OFFSET_X << ","	\
	<< SCALE*(y) + OFFSET_Y << ","										\
	<< SCALE*(r) << ")" << endl;

typedef long long ll;
typedef complex<double> Point;

typedef pair<int, int> pii;
typedef pair<int, pii> ipii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector< vector<int> > vii;
typedef vector< vector<double> > vdd;

typedef vector<int>::iterator vi_itr;

const int IINF = 1 << 28;
const double INF = 1e30;
const double EPS = 1e-10;
const double PI = acos(-1.0);

// Direction : L U R D
const int dx[] = { -1, 0, 1, 0};
const int dy[] = { 0, -1, 0, 1 };

struct edge{
	int to, cap, rev;
	edge() {}
	edge(int to, int cap, int rev) :to(to), cap(cap), rev(rev) {}
};

int W, N, M;
int J[50], C[50];

const int MAX_V = 105;
vector<edge> G[MAX_V];
vector<edge> G_org[MAX_V];
int level[MAX_V];
int iter[MAX_V];

void add_edge( int from, int to, int cap )
{
	G[from].pb(edge(to, cap, G[to].size()));
	G[to].pb(edge(from, 0, 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();
		rep(i, G[v].size()){
			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, IINF)) > 0 ){
			flow += f;
		}
	}
}

int main()
{
	cin >> W >> N;
	rep(i, N) cin >> J[i];
	cin >> M;
	rep(i, M) cin >> C[i];

	rep(i, M){
		int Q, X[50] = { 0 };
		cin >> Q;
		rep(j, Q){
			cin >> X[j];
			--X[j];
		}

		int cur = 0;
		rep(j, N){
			if( j == X[cur] ){
				++cur;
				continue;
			}
			if( j != X[cur] ){
				add_edge(1+j, 1+N+i, J[j]);
			}
		}
	}
	rep(i, N){
		add_edge(0, 1+i, W);
	}
	rep(i, M){
		add_edge(1+N+i, 1+N+M, C[i]);
	}

	cout << (max_flow(0, 1+N+M) == W ? "SHIROBAKO" : "BANSAKUTSUKITA") << endl;
}