package no223;

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[][] ans = even1(n);
		for(int i=0;i<n;i++) {
			for(int j=0;j<n;j++) {
				ans[i][j]--;
			}
		}
		int x = sc.nextInt() - 1;
		int y = sc.nextInt() - 1;
		int z = sc.nextInt() - 1;
		int xor = ans[y][x] ^ z;
		for(int i=0;i<n;i++) {
			for(int j=0;j<n;j++) {
				ans[i][j] = (ans[i][j] ^ xor) + 1;
			}
		}


		StringBuilder sb = new StringBuilder();
		for(int i=0;i<n;i++) {
			for(int j=0;j<n;j++) {
				if (j > 0) {
					sb.append(' ');
				}
				sb.append(ans[i][j]);
			}
			sb.append('\n');
		}

		System.out.print(sb.toString());
	}

	// http://d.hatena.ne.jp/ziom/20090620/p1
	public static int[][] even1(int n) {
		int[][] m = new int[n][n];
		for(int i=0;i<n;i++) {
			for(int j=0;j<n;j++) {
				m[i][j] = i * n + j + 1;
			}
		}
		for(int i=0;i<n/2;i++) {
			for(int j=0;j<n;j++) {
				if (((i + 1) / 2 + (j + 1) / 2) % 2 == 1) {
					int temp = m[i][j];
					m[i][j] = m[n-1-i][n-1-j];
					m[n-1-i][n-1-j] = temp;
				}
			}
		}
		return m;
	}
}