[CODEVS3323]时空跳跃者的封锁

var
        f,map:array[0..101,0..101,0..101] of longint;
        i,j,k,l,m,n,x,y,z,sum:longint;

        function max(a,b,c:longint):longint;
        begin max:=-maxlongint;
        if a>max then max:=a;
        if b>max then max:=b;
        if c>max then max:=c;
        end;

        begin
                readln(x,y,z);
                readln(m);
                for i:=1 to m do readln(j,k,l,map[j][k][l]);
                for i:=1 to x do
                for j:=1 to y do
                for k:=1 to z do
                f[i][j][k]:=max(f[i-1][j][k],f[i][j-1][k],f[i][j][k-1])+map[i][j][k];
                readln(sum);
                if f[x][y][z]>=sum then writeln(f[x][y][z]) else writeln(‘BigBang!‘);
        end.