#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#include <queue>
#include <set>

using namespace std;

//namaega184

int main(){
	int n,x,y,z;scanf("%d%d%d%d",&n,&x,&y,z);
	int a[21][21]={};
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			int b=n*i+j+1;
			if(b%4==1||b%4==0)a[i][j]=b; 
			else a[n-1-i][n-1-j]=b;
		}
	}
	int px=0,py=0;
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(a[i][j]==z){px=j,py=i;break;}
		}
	}
	int b[21][21]={}; 
	px-=x,py-=y;
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			b[i][j]=a[(j-py+n)%n][(i-px+n)%n];
		}
	} 
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(j==0)printf("%d",b[i][j]);
			else printf(" %d",b[i][j]);
		}
		puts("");
	}
	
	return 0; 
}