n = 960
f = [1,1] 
ax = [1] * n 
ay = [1] * n 
id = [1] * n
for i in range (2,n) : 
    f.append(f[-1]+f[-2])
for i in range (1,n) :
    if i%2==1 :
        if i==1 :
            ax[i],ay[i],id[i]=ax[i-1]+1,ay[i-1],2
        else :
            ax[i],ay[i],id[i]=ax[i-1]+1,ay[i-1],id[i-1]+1
    else :
        if i==2 :
            ax[i],ay[i],id[i]=ax[i-1],ay[i-1]+1,id[i-1]+2
        else :
            ax[i],ay[i],id[i]=ax[i-1],ay[i-1]+1,id[i-1]+3
k, q, x, y = [int(t) for t in input().split(' ')]
print(n-2)
print(1,1)
print(2,1)
for i in range (2,n//4+1) :
    print(i-1,i)
    print(i,i)
    print(i+1,i)
    print(i+1,i-1)
for i in range (0,q) :
    s = [0] * (n-2)
    now = int (input())
    for j in range (n-1,-1,-1) :
        if now >= f[j] : 
            s[id[j]-1]=1
            now -= f[j]
    for c in s:
        print(c, end='')
    print()