import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.BitSet;
import java.util.HashMap;
import java.util.List;
 
public class Main {
	public static void main(String[] args) throws NumberFormatException,
	IOException {Solve solve = new Solve();solve.solve();}
}
class Solve{
	void solve() throws NumberFormatException, IOException{
		ContestScanner in = new ContestScanner();
		Writer out = new Writer();
		int w = in.nextInt();
		int n = in.nextInt();
		int[] j = new int[n];
		for(int i=0; i<n; i++) j[i] = in.nextInt();
		int m = in.nextInt();
		int s = n+m;
		int t = n+m+1;
		MaxFlow mf = new MaxFlow(n+m+2, s, t);
		for(int i=0; i<n; i++) mf.edge(s, i, j[i]);
		for(int i=0; i<m; i++) mf.edge(n+i, t, in.nextInt());
		BitSet fob = new BitSet(n);
		for(int i=0; i<m; i++){
			int q = in.nextInt();
			fob.clear();
			for(int k=0; k<q; k++){
				fob.set(in.nextInt()-1);
			}
			for(int k=fob.nextClearBit(0)
					; k<n; k=fob.nextClearBit(k+1)){
				mf.edge(k, n+i, MaxFlow.inf);
			}
		}
		System.out.println(mf.solve()<w?"BANSAKUTSUKITA":"SHIROBAKO");
	}
}
class MaxFlow{
	int n, s, t;
	HashMap<Integer, Integer>[] node;
	MaxFlow(int n, int s, int t) {
		this.n=n;this.s=s;this.t=t;node=new HashMap[n];
		for(int i=0;i<n;i++)node[i]=new HashMap<>();
		used = new BitSet(n);
	}
	void edge(int a, int b, int f){
		if(node[a].containsKey(b)){
			node[a].put(b, node[a].get(b)+f);
		}else{
			node[a].put(b, f);
			node[b].put(a, 0);
		}
	}
	final static int inf = Integer.MAX_VALUE/2;
	int solve(){
		int res = 0;
		while(true){
			used.clear();
			int flow = flow(s, inf);
			if(flow == 0) break;
			res += flow;
		}
		return res;
	}
	BitSet used;
	int flow(int from, int flow){
		if(from == t) return flow;
		if(used.get(from)) return 0;
		used.set(from);
		HashMap<Integer,Integer> nd = node[from];
		for(int v: nd.keySet()){
			final int cap = nd.get(v);
			if(cap==0) continue;
			int f = flow(v, Math.min(flow, cap));
			if(f == 0) continue;
			nd.put(v, cap-f);
			node[v].put(from, node[v].get(from)+f);
			return f;
		}
		return 0;
	}
}

class MultiSet<T> extends HashMap<T, Integer>{
	@Override
	public Integer get(Object key){return containsKey(key)?super.get(key):0;}
	public void add(T key,int v){put(key,get(key)+v);}
	public void add(T key){put(key,get(key)+1);}
	public void sub(T key){
		final int num = get(key);
		if(num==1) remove(key);
		else put(key, num-1);
	}
}
class Timer{
	long time;
	public void set(){time = System.currentTimeMillis();}
	public long stop(){return System.currentTimeMillis()-time;}
}
class Writer extends PrintWriter{
	public Writer(String filename) throws IOException
	{super(new BufferedWriter(new FileWriter(filename)));}
	public Writer() throws IOException{super(System.out);}
}
class ContestScanner {
	private BufferedReader reader;
	private String[] line;
	private int idx;
	public ContestScanner() throws FileNotFoundException 
	{reader = new BufferedReader(new InputStreamReader(System.in));}
	public ContestScanner(String filename) throws FileNotFoundException
	{reader = new BufferedReader(new InputStreamReader(new FileInputStream(filename)));}
	public String nextToken() throws IOException {
		if (line == null || line.length <= idx) {
			line = reader.readLine().trim().split(" ");
			idx = 0;
		}
		return line[idx++];
	}
	public String readLine() throws IOException{return reader.readLine();}
	public long nextLong() throws IOException, NumberFormatException
	{return Long.parseLong(nextToken());}
	public int nextInt() throws NumberFormatException, IOException
	{return (int) nextLong();}
	public double nextDouble() throws NumberFormatException, IOException 
	{return Double.parseDouble(nextToken());}
}