城市修路 连通

//java

//http://acm.hdu.edu.cn/showproblem.php?pid=1232

import java.util.*;
public class Main{
static Scanner inScanner=new Scanner(System.in);
static int[] key=new int[1010];
static int find(int t){
if(key[t]==-1)  return t;
return find(key[t]);
}
static void addRoad(int x,int y){
x=find(x);
y=find(y);
if(x!=y)
key[x]=y;
}
public static void main(String[] args) {
// TODO Auto-generated method stub
while(inScanner.hasNext()){
int city=inScanner.nextInt();
int road=inScanner.nextInt();
if(city==0)  break;
Arrays.fill(key, -1);
while(road--!=0){
addRoad(inScanner.nextInt(),inScanner.nextInt());
}
int count=0;
for(int i=1;i<=city;i++){
if(key[i]==-1)
count++;
}
System.out.println(count-1);
}
}
}