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

class Fq {
	static int deg;
	static long irrPoly;
	long poly;
	public Fq(long poly) {
		this.poly=poly;
	}
	static void setDegree(int d) {
		deg=d;// F_{2^d}, deg(irrPoly)=d
		irrPoly=new long[]{1,2,5,11,23}[d];
	}
	Fq add(Fq o) {
		return new Fq(poly^o.poly);
	}
	Fq mul(Fq o) {
		Fq ret=new Fq(0);
		for (int i=0;i<=deg+1;++i) {
			if ((o.poly>>i)%2==1) {
				ret.poly^=poly<<i;
			}
		}
		for (int shift=deg+1;shift>=0;--shift) {;
			if ((ret.poly>>(shift+deg))%2==1) {
				ret.poly^=irrPoly<<shift;
			}
		}
		assert(ret.poly<irrPoly);
		return ret;
	}
	void tr(Object...o) {System.out.println(Arrays.deepToString(o));}
}

public class Main {
	public static void main(String[] args) {
		new Main().run();
	}
	
	
	void run() {
		FastScanner sc=new FastScanner();
		int N=sc.nextInt();
		int X=sc.nextInt();
		int Y=sc.nextInt();
		int Z=sc.nextInt();
		X^=Y;Y^=X;X^=Y;
		--X;--Y;
		Fq.setDegree(Integer.numberOfTrailingZeros(N));
		Fq[][] mat1=new Fq[N][N];
		Fq[][] mat2=new Fq[N][N];
		long[][] mat=new long[N][N];
		for (int i=0;i<N;++i) {
			for (int j=0;j<N;++j) {
				mat1[i][j]=new Fq(i).add(new Fq(j).mul(new Fq(2)));
				mat2[i][j]=new Fq(i).add(new Fq(j).mul(new Fq(3)));
			}
		}
		for (int i=0;i<N;++i) {
			for (int j=0;j<N;++j) {
				mat[i][j]=mat1[i][j].poly+N*mat2[i][j].poly;
			}
		}
		long add=mat[X][Y]^Z;
		for (int i=0;i<N;++i) {
			for (int j=0;j<N;++j) {
				mat[i][j]^=add;
				System.out.print((mat[i][j]+1)+(j==N-1?"\n":" "));
			}
		}
	}

	void tr(Object...o) {System.out.println(Arrays.deepToString(o));}
}

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());}
}