import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

H, W, A, B = MAP()

for i in range(H-B):
    print("0"*A+"1"*(W-A))
for i in range(B):
    print("1"*A+"0"*(W-A)) import sys, re sys re from collections import deque, defaultdict, Counter from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians from itertools import accumulate, permutations, combinations, product from operator import itemgetter, mul from copy import deepcopy from string import ascii_lowercase, ascii_uppercase, digits from bisect import bisect, bisect_left from fractions import gcd from heapq import heappush, heappop from functools import reduce def input(): return sys.stdin.readline().strip() input def INT(): return int(input()) INT def MAP(): return map(int, input().split()) MAP def LIST(): return list(map(int, input().split())) LIST MAP() for _ in range(n) for _ in range(n) _ range(n) range n for _ in range(n) MAP() MAP def ZIP(n): return zip(*(MAP() for _ in range(n))) ZIP n n sys.setrecursionlimit(10 ** 9) sys.setrecursionlimit sys setrecursionlimit 10 ** 9 10 9 INF = float('inf') INF float('inf') float 'inf' mod = 10 ** 9 + 7 mod 10 ** 9 + 7 10 ** 9 10 9 7 H, W, A, B = MAP() H MAP() MAP W A B for i in range(H-B):
    print("0"*A+"1"*(W-A)) i range(H-B) range H-B H B print("0"*A+"1"*(W-A)) print "0"*A+"1"*(W-A) "0"*A "0" A "1"*(W-A) "1" W-A W A for i in range(B):
    print("1"*A+"0"*(W-A)) i range(B) range B print("1"*A+"0"*(W-A)) print "1"*A+"0"*(W-A) "1"*A "1" A "0"*(W-A) "0" W-A W A W, A, B = MAP() MAP() W def LIST(): return list(map(int, input().split())) def LIST(): return list(map(int, input().split())) LIST def ZIP(n): return zip(*(MAP() for _ in range(n))) def ZIP(n): return zip(*(MAP() for _ in range(n))) ZIP H, W, A, B = MAP() MAP() H A, B = MAP() MAP() A def MAP(): return map(int, input().split()) def MAP(): return map(int, input().split()) MAP def input(): return sys.stdin.readline().strip() def input(): return sys.stdin.readline().strip() input mod = 10 ** 9 + 7 10 ** 9 + 7 mod INF = float('inf') float('inf') INF def INT(): return int(input()) def INT(): return int(input()) INT B = MAP() MAP() B
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

H, W, A, B = MAP()

for i in range(H-B):
    print("0"*A+"1"*(W-A))
for i in range(B):
    print("1"*A+"0"*(W-A))
