#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; }

void solve(int n, vector<int>x) {
	vector ans(n, vector<int>(n));
	int idx = 0;
	rep(i, x[1]) ans[idx / n][idx % n] = 2, idx++;
	if (x[0] <= x[2]) {
		rep(i, x[0]) ans[idx / n][idx % n] = 1, idx++;
		rep(i, x[2]) ans[idx / n][idx % n] = 3, idx++;
	}
	else {
		rep(i, x[2]) ans[idx / n][idx % n] = 3, idx++;
		rep(i, x[0]) ans[idx / n][idx % n] = 1, idx++;
	}
	{
		int p = (x[1] - 1) / n;
		int q = (x[1] - 1) % n;
		if (p != n - 1 && q != n - 1 && ans[p + 1][q] != ans[p][q + 1]) {
			//cout << p + 1 << "_" << q << endl;
			//cout << p << "_" << q + 1 << endl;
			swap(ans[p][q + 1], ans[n - 1][n - 1]);
		}
	}
	rep(i, n) {
		rep(j, n)cout << ans[i][j];
		cout << endl;
	}
}
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n; cin >> n;
	vector<int>x(3);
	rep(i, 3)cin >> x[i];
	solve(n, x);
	return 0;
}