#include<bits/stdc++.h>
#define CSP2026 using
#define RP namespace
#define PLUSPLUS std
CSP2026 RP PLUSPLUS;
#define debug(x) cout<<"clock="<<clock()<<' '<<#x<<'='<<(x)<<'\n'
//#define getchar getchar_unlocked
using ll=long long;
inline int rd(){int x=0,f=1;char ch=getchar();for(;!isdigit(ch);ch=getchar())if(ch=='-')f=-1;for(;isdigit(ch);ch=getchar())x=(x<<3)+(x<<1)+(ch^48);return x*f;}
inline ll rdll(){ll x=0;int f=1;char ch=getchar();for(;!isdigit(ch);ch=getchar())if(ch=='-')f=-1;for(;isdigit(ch);ch=getchar())x=(x<<3)+(x<<1)+(ch^48);return x*f;}
constexpr int N=505;
int a[N][N],bcnt;
mt19937 rnd(time(0)^random_device{}());
struct node{int x,y,t;}b[N*N];
signed main(){
	int n=rd(),A=rd(),B=rd(),C=rd();
	for(int i=1;i<=n;++i)for(int j=1;j<=n;++j)b[++bcnt]={i,j,rnd()};
	sort(b+1,b+bcnt+1,[](const node &p1,const node &p2)->bool{
		return p1.x+p1.y==p2.x+p2.y?p1.t<p2.t:p1.x+p1.y<p2.x+p2.y;
	});
	
	if(C<A){
		for(int i=1;i<=C;++i)a[b[i].x][b[i].y]=3;
		for(int i=C+1;i<=C+A;++i)a[b[i].x][b[i].y]=1;
	}else{
		for(int i=1;i<=A;++i)a[b[i].x][b[i].y]=1;
		for(int i=A+1;i<=C+A;++i)a[b[i].x][b[i].y]=3;
	}
	for(int i=C+A+1;i<=n*n;++i)a[b[i].x][b[i].y]=2;
	for(int i=1;i<=n;++i,putchar(10))for(int j=1;j<=n;++j)cout<<a[i][j];
}