import bisect
import math
import sys
from collections import defaultdict
from itertools import accumulate
from math import isqrt, inf
from typing import List, Tuple

sys.setrecursionlimit(10 ** 6)

MOD = 998244353

int1 = lambda x: int(x) - 1
input = lambda: sys.stdin.readline().rstrip('\n')
ii = lambda: int(input())
vi = lambda: list(map(int, input().split()))
vi1 = lambda: list(map(int1, input().split()))


def dbg(*args, **kwargs):
    print(*(repr(arg) for arg in args), *(f'{k}: {repr(v)}' for k, v in kwargs.items()),
          sep='; ', file=sys.stderr, flush=True)


def main():
    n, a, b, c = vi()

    arr = [[None] * n for _ in range(n)]
    for i in range(n):
        for j in range(n):
            if b > 0:
                arr[i][j] = 2
                pi, pj = i, j
                b -= 1
    lg = 3 if c > a else 1
    if pi != n - 1:
        arr[pi + 1][pj] = lg
        if lg == 3:
            c -= 1
        else:
            a -= 1
    if pj != n - 1:
        arr[pi][pj + 1] = lg
        if lg == 3:
            c -= 1
        else:
            a -= 1
    for i in range(n):
        for j in range(n):
            if arr[i][j] is None:
                if a > 0:
                    arr[i][j] = 1
                    a -= 1
                else:
                    arr[i][j] = 3
                    c -= 1
    for r in arr:
        print(''.join(map(str, r)))


def _start():
    if (ret := main()) is not None:
        print(*ret) if isinstance(ret, List) or isinstance(ret, Tuple) else print(ret)


if __name__ == '__main__':
    _start()