//$
/*
#include <stdio.h>
int main()
{
int arr[27][27]={};
int i,j,a,b,sum=0;
for (i=1;i<=25;i++)
for (j=1;j<=25;j++)
scanf("%d", &arr[i][j]);
for (i=1;i<=25;i++){
for (j=1;j<=25;j++){
sum=0;
for(a=i-1;a<=i+1;a++)
for(b=j-1;b<=j+1;b++)
sum+=arr[a][b];
if(arr[i][j]==1) sum--;
if(arr[i][j]==0)
{
if (sum ==3){
printf("1 ");
}
else{
printf("0 ");
}
}
else{
if (sum>=4 || sum <=1){
printf("0 ");
}
else if (sum==2 || sum==3){
printf("1 ");
}
}
}
printf("\n");
}
}
*/
/*
#include <stdio.h>
int main()
{
int arr[55][55]={};
int i,j,n,k;
//1. scan n
scanf("%d",&n);
//2. insert numbers
i=1;
j=n/2+1;
for(k=1;k<=n*n;k++){
arr[i][j]=k;
if (k%n==0){
i++;
continue;
}
if ( j!=n){
j++;
}
else {
j=1;
}
if (i!=1){
i--;
}
else {
i=n;
}
}
//3. print magic square
for (i=1;i<=n;i++){
for (j=1;j<=n;j++){
printf("%d ",arr[i][j]);
}
printf("\n");
}
}
*/
/*
#include <stdio.h>
int main ()
{
int arr[102][102]={};
int i,j,x,y,n,k=0;
scanf("%d",&n);
scanf("%d %d",&x,&y);
arr[x][y]=1;
for (j=y-1;j>=1;j--){
arr[x][j]=arr[x][j+1]+1;
}
for (j=y+1;j<=n;j++){
arr[x][j]=arr[x][j-1]+1;
}
for (i=x-1;i>=1;i--){
for (j=1;j<=n;j++){
arr[i][j]=arr[i+1][j]+1;
}
}
for (i=x+1;i<=n;i++){
for (j=1;j<=n;j++){
arr[i][j]=arr[i-1][j]+1;
}
}
for (i=1;i<=n;i++){
for (j=1;j<=n;j++){
printf("%d ",arr[i][j]);
}
printf("\n");
}
}
*/
// 1. 등고선 다른방식으로 풀기 (틀은 댓글로 적어줄게용!)
// 2. [기초-2차원배열] 성실한 개미는 홀수 마방진 푼 방식으로
// 3. 4592색종이 1 -> 4개의 직사각형 넓이
#include <stdio.h>
int main ()
{
int arr[102][102]={};
int i,j,x,y,n,k=0;
scanf("%d %d %d",&n,&x,&y);
for (i=1;i<=n;i++){
for (j=1;j<=n;j++){
arr[i][j]= ?? ; //x, y, i, j를 모두 사용해서 채워보세요!
}
}
for (i=1;i<=n;i++){
for (j=1;j<=n;j++){
printf("%d ",arr[i][j]);
}
printf("\n");
}
return 0;
}