#include #include using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; typedef vector vi; typedef vector vl; typedef vector vvl; typedef vector vvvl; typedef vector vvvvl; typedef vector vb; typedef vector vvb; typedef vector vvvb; typedef vector vvvvb; typedef pair pl; typedef pair ppl; typedef pair pppl; typedef pair pppppl; #define rep(i,a,b) for(int i=(a);i<(b);i++) #define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--) #define all(a) begin(a),end(a) #define sz(a) (int)(a).size() #define F first #define S second #define bs(A,x) binary_search(all(A),x) #define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin()) #define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin()) #define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x)) templateusing min_priority_queue=priority_queue,greater>; templatebool chmax(T&a,T b){if(abool chmin(T&a,T b){if(b vm; typedef vector vvm; typedef vector vvvm; typedef vector vvvvm; ostream&operator<<(ostream&os,mint a){os<>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;} //*/ templateostream&operator<<(ostream&os,pairp){os<istream&operator>>(istream&is,pair&p){is>>p.F>>p.S;return is;} templateostream&operator<<(ostream&os,vectorv){rep(i,0,sz(v))os<istream&operator>>(istream&is,vector&v){for(T&in:v)is>>in;return is;} int main(){ cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit); ll N,A,B,C;cin>>N>>A>>B>>C; vvl ans(N,vl(N)); if(A>=N){ rep(i,0,N)rep(j,0,N){ if(B)ans[i][j]=2,B--; else if(A)ans[i][j]=1,A--; else ans[i][j]=3,C--; } } else if(C>=N){ rep(i,0,N)rep(j,0,N){ if(B)ans[i][j]=2,B--; else if(C)ans[i][j]=3,C--; else ans[i][j]=1,A--; } } else if(N>=4||(N==3&&A+C<=N)){ rep(i,0,N)rep(j,0,N){ if(A)ans[i][j]=1,A--; else if(B)ans[i][j]=2,B--; else ans[i][j]=3,C--; } } else if(N==2){ if(B==2)ans={{2,2},{1,3}}; else if(A==2)ans={{2,1},{1,3}}; else ans={{2,3},{3,1}}; } else ans={{1,1,3},{2,2,2},{2,2,3}}; rep(i,0,N){rep(j,0,N)cout<