import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.PriorityQueue;

class Edge {
	int src,dst,rev;
	int res;

	public Edge(int src,int dst,int res,int rev) {
		this.src=src;
		this.dst=dst;
		this.res=res;
		this.rev=rev;
	}
}

public class Main{
	
	public static void main(String[] args) {
		new Main().run();
	}
	
	int f(int s,int t,ArrayList<Edge>[] g) {
		int n=g.length;
		int flow=0;
		class State implements Comparable<State>{
			int v;
			int res;
			public State(int v,int res) {
				this.v=v;
				this.res=res;
			}
			public int compareTo(State o) {
				return -Integer.compare(res, o.res);
			};
		}
		int INF=Integer.MAX_VALUE/3;
		while (true) {
			PriorityQueue<State> pq=new PriorityQueue<>();
			pq.add(new State(s,INF));
			int[] res=new int[n];
			int[] backedge=new int[n];
			Arrays.fill(backedge, -1);
			res[s]=INF;
			while (!pq.isEmpty()) {
				State state=pq.poll();
				if (res[state.v]>state.res) continue;
				for (var e:g[state.v]) {
					int nres=Math.min(e.res, state.res);
					if (nres <= res[e.dst]) continue;
					res[e.dst]=nres;
					backedge[e.dst]=e.rev;
					pq.add(new State(e.dst, nres));
				}
			}
			if (res[t]==0) break;
			flow+=res[t];
			for (int cur=t;cur!=s;) {
				Edge e=g[cur].get(backedge[cur]);
				e.res+=res[t];
				g[e.dst].get(e.rev).res-=res[t];
				cur=e.dst;
			}
		}
		return flow;
	}
	
	void run() {
		FastScanner sc=new FastScanner();
		int INF=Integer.MAX_VALUE/3;
		int W=sc.nextInt();
		int N=sc.nextInt();
		int[] J=new int[N];
		for (int i=0;i<N;++i) J[i]=sc.nextInt();
		int M=sc.nextInt();
		int[] C=new int[M];
		for (int i=0;i<M;++i) C[i]=sc.nextInt();
		boolean[][] connect=new boolean[N][M];
		for (int i=0;i<N;++i) for (int j=0;j<M;++j) connect[i][j]=true;
		for (int i=0;i<M;++i) {
			int Q=sc.nextInt();
			for (int q=0;q<Q;++q) {
				int x=sc.nextInt()-1;
				connect[x][i]=false;
			}
		}
		int s=N+M;
		int t=N+M+1;
		ArrayList<Edge>[] g=new ArrayList[N+M+2];
		for (int i=0;i<N+M+2;++i) g[i]=new ArrayList<>();
		for (int i=0;i<N;++i) {
			for (int j=0;j<M;++j) {
				if (connect[i][j]) {
					Edge e0=new Edge(i,j+N,INF,g[j+N].size());
					Edge e1=new Edge(j+N,i,0,g[i].size());
					g[i].add(e0);
					g[j+N].add(e1);
				}
			}
		}
		for (int i=0;i<N;++i) {
			Edge e0=new Edge(s,i,J[i],g[i].size());
			Edge e1=new Edge(i,s,0,g[s].size());
			g[s].add(e0);
			g[i].add(e1);
		}
		for (int i=0;i<M;++i) {
			Edge e0=new Edge(i+N,t,C[i],g[t].size());
			Edge e1=new Edge(t,i+N,0,g[i+N].size());
			g[i+N].add(e0);
			g[t].add(e1);
		}
		if (f(s,t,g) >= W) {
			System.out.println("SHIROBAKO");
		} else {
			System.out.println("BANSAKUTSUKITA");
		}
	}
	
	void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));}
}

class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    
    public double nextDouble() { return Double.parseDouble(next());}
}