#include <stdio.h>
int father[1005];
void get()
{
for(int i=1;i<=1001;i++)
{
father[i]=i;
}
}
int find(int x)
{
if(father[x]!=x)
{
father[x]=find(father[x]);
}
return father[x];
}
int find1(int x)
{
while(x!=father[x])
{
x=father[x];
}
return x;
}
int find2(int x)
{
return father[x]=x?father[x]:find2(father[x]);
}
void link_father(int x,int y)
{
if(find(x)!=find(y))
{
father[find(x)]=find(y);
}
}
int main()
{
int n,m;
while(~scanf("%d",&n))
{
if(n==0) break;
get();
int x,y;
int sum=0;
scanf("%d",&m);
while(m--)
{
scanf("%d %d",&x,&y);
link_father(x,y);
}
for(int i=1;i<=n;i++)
{
if(father[i]==i)
{
sum++;
}
}
printf("%d\n",sum-1);
}
}