import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    H, W, A, B = LI()

    ans = [['0'] * W for _ in range(H)]
    for i in range(H):
        for j in range(W):
            if i < B and j < A or i >= B and j >= A:
                ans[i][j] = '1'

    for i in ans:
        print(''.join(i))

if __name__ == '__main__':
    resolve() import bisect, collections, copy, heapq, itertools, math, string, sys bisect collections copy heapq itertools math string sys input = lambda: sys.stdin.readline().rstrip() input lambda: sys.stdin.readline().rstrip() sys.stdin.readline().rstrip() sys.stdin.readline().rstrip sys.stdin.readline() sys.stdin.readline sys.stdin sys stdin readline rstrip sys.setrecursionlimit(10**7) sys.setrecursionlimit sys setrecursionlimit 10**7 10 7 INF = float('inf') INF float('inf') float 'inf' def I(): return int(input()) I def F(): return float(input()) F def SS(): return input() SS int(x) for x in input().split() for x in input().split() x input().split() ().split () input split for x in input().split() int(x) int x def LI(): return [int(x) for x in input().split()] LI int(x)-1 for x in input().split() for x in input().split() x input().split() ().split () input split for x in input().split() int(x)-1 int(x) int x 1 def LI_(): return [int(x)-1 for x in input().split()] LI_ float(x) for x in input().split() for x in input().split() x input().split() ().split () input split for x in input().split() float(x) float x def LF(): return [float(x) for x in input().split()] LF def LSS(): return input().split() LSS def resolve():
    H, W, A, B = LI()

    ans = [['0'] * W for _ in range(H)]
    for i in range(H):
        for j in range(W):
            if i < B and j < A or i >= B and j >= A:
                ans[i][j] = '1'

    for i in ans:
        print(''.join(i)) resolve H, W, A, B = LI() H LI() LI W A B ['0'] * W for _ in range(H) for _ in range(H) _ range(H) range H for _ in range(H) ['0'] * W ['0'] '0' W ans = [['0'] * W for _ in range(H)] ans [['0'] * W for _ in range(H)] for i in range(H):
        for j in range(W):
            if i < B and j < A or i >= B and j >= A:
                ans[i][j] = '1'

     i range(H) range H for j in range(W):
            if i < B and j < A or i >= B and j >= A:
                ans[i][j] = '1'

     j range(W) range W if i < B and j < A or i >= B and j >= A:
                ans[i][j] = '1'

     i < B and j < A or i >= B and j >= A i < B and j < A i < B i B j < A j A i >= B and j >= A i >= B i B j >= A j A ans[i][j] = '1' ans[i][j] [i] ans i j '1' for i in ans:
        print(''.join(i)) i ans print(''.join(i)) print ''.join(i) ''.join '' join i if __name__ == '__main__':
    resolve() __name__ == '__main__' __name__ '__main__' resolve() resolve def LI_(): return [int(x)-1 for x in input().split()] def LI_(): return [int(x)-1 for x in input().split()] LI_ def F(): return float(input()) def F(): return float(input()) F def LF(): return [float(x) for x in input().split()] def LF(): return [float(x) for x in input().split()] LF def I(): return int(input()) def I(): return int(input()) I def LSS(): return input().split() def LSS(): return input().split() LSS INF = float('inf') float('inf') INF input = lambda: sys.stdin.readline().rstrip() lambda: sys.stdin.readline().rstrip() input def LI(): return [int(x) for x in input().split()] def LI(): return [int(x) for x in input().split()] LI def resolve():
    H, W, A, B = LI()

    ans = [['0'] * W for _ in range(H)]
    for i in range(H):
        for j in range(W):
            if i < B and j < A or i >= B and j >= A:
                ans[i][j] = '1'

    for i in ans:
        print(''.join(i)) def resolve():
    H, W, A, B = LI()

    ans = [['0'] * W for _ in range(H)]
    for i in range(H):
        for j in range(W):
            if i < B and j < A or i >= B and j >= A:
                ans[i][j] = '1'

    for i in ans:
        print(''.join(i)) resolve def SS(): return input() def SS(): return input() SS
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    H, W, A, B = LI()

    ans = [['0'] * W for _ in range(H)]
    for i in range(H):
        for j in range(W):
            if i < B and j < A or i >= B and j >= A:
                ans[i][j] = '1'

    for i in ans:
        print(''.join(i))

if __name__ == '__main__':
    resolve()
