/*
#include<stdio.h>
int a[100001]= {},n;
int partition(int left, int right)
{
int low=left,high=right,temp;
int pivot=(int)((left+right)/2.0);
while(low<high)
{
while(a[low]<a[pivot] && low<high)
{
low++;
}
while(a[high]>=a[pivot] && low<high)
{
high--;
}
if(low<high)
{
temp=a[high];
a[high]=a[low];
a[low]=temp;
if(low==pivot)
{
pivot = high;
}
}
}
temp=a[pivot];
a[pivot]=a[high];
a[high]=temp;
return high;
}
void quicksort(int left, int right)
{
int p;
if(left<right)
{
p=partition(left,right);
quicksort(left,p-1);
quicksort(p+1,right);
}
}
int main()
{
int i;
scanf("%d",&n);
for(i=1; i<=n; i++)
{
scanf("%d",&a[i]);
}
quicksort(1,n);
for(i=1; i<=n; i++)
{
printf("%d\n",a[i]);
}
return 0;
}
*/
#include<stdio.h>
#define size
int stack[size];
int top=-1;
void push(int data)
{
for(top==size-1)
return ;
stack[++top]=data;
}
int pop()
{
if(top==-1)
{
return 0;
}
return stack[top--];
}
int main()
{
int i,a,b,n,m,arr[101][101]={};
scanf("%d %d",&n,&m);
for(i=1; i<=m; i++)
{
scanf("%d %d",&a,&b);
arr[a][b]=1;
arr[b][a]=1;
}
}