hdoj1232 //简单并查集

#include<iostream>
using namespace std;


int par[1001],rankk[1001];


void init(int n){
for(int i = 0;i<=n;++i){
par[i] = i;
rankk[i] = 0;
}
}


int find(int x){
if(par[x] == x)
return x;
else
return par[x] = find(par[x]);
}


void unite(int x,int y){
int a,b;
a = find(x);
b = find(y);
if(a == b)
return;
if(rankk[b] > rankk[a]){
par[a] = b;
}
else{
par[b] = a;
if(rankk[a] == rankk[b])
++rankk[a];
}
}


bool same(int x,int y){
return find(x) == find(y);
}


int main(){
int n,m,x,y;
while(cin>>n&&n){
cin>>m;
init(n);
int ans = n-1;
for(int i = 0;i<m;++i){
cin>>x>>y;
if(!(same(x,y))){
unite(x,y);
--ans;
}
}
cout<<ans<<endl;
}
return 0;
}