/*
#include<stdio.h>
int main()
{
int n,k,i,j,temp;
int a[2002]={};
scanf("%d %d",&n,&k);
for (i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
for (j=n+1;j<=n+k;j++)
{
scanf("%d",&a[j]);
}
for(i=1; i<n+k; i++)
{
for(j=1;j<=n+k-i;j++)
{
if (a[j] > a[j+1])
{
temp = a[j];
a[j] = a[j+1];
a[j+1] = temp;
}
}
}
for (i = 1; i <= n+k; i++)
printf("%d ", a[i]);
return 0;
}
#include<stdio.h>
#include<string.h>
int compare(char* x,char* y){
if(strcmp(x,y)>0) return 1;
else return -1;
}
int main()
{
int n,i,j, k;
char temp[11]={};
char a[10001][11]={};
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%s",a[i]);
}
qsort(a,n,sizeof(char)*11,compare);
for (i=1;i<=n;i++)
{
printf("%s\n",a[i]);
}
return 0;
}
#include<stdio.h>
int main()
{
int n,f,i,j,s,d;
int a[101] [101]={};
scanf("%d %d",&n,&f);
for(i=1;i<=f;i++)
{
scanf("%d %d",&s,&d);
//s노드와 d노드가 연결되어있다
a[s][d]=1;
a[d][s]=1;
}
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
{
printf("%d ",a[i][j]);
}
printf("\n");
}
}
*/
#include<stdio.h>
int main()
{
int n,m,i,j,b,f;
int a[501][501]={};
scanf("%d %d",&n,&m);
for(i=1;i<=m;i++)
{
scanf("%d %d",&b,&f);
a[b][f]=1;
}
for (i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
printf("%d ",a[i][j]);
}
printf("\n");
}
}