251015

arr=[]
queue=[]
back=-1
front=-1
qlist=[]
sum=2
n=int(input())
for i in range(n):
    c=[0]*n
    arr.append(c)
x, y=map(int, input().split())
k=x-1
p=y-1

arr[k][p]=1
back+=1
qlist.append(k)
qlist.append(p)
queue.append(qlist)



while back != front:
    for i in range(front+1, back+1):
        front += 1
        plist = queue.pop(0)
        s = plist[0]
        r = plist[1]

        if s+1<=n-1:
            arr[s+1][r]=sum
            queue.append([s+1, r])
        if s-1>=0:
            arr[s-1][r]=sum
            queue.append([s-1, r])
        arr[s][r+1]=sum

        arr[s][r-1]=sum
        back+=1

        queue.append([s, r+1])

        queue.append([s, r-1])
        print(queue)
    sum+=1



for i in range(n):
    for j in range(n):
        print(arr[i][j], end=' ')


    print()