HDU1232

#include<iostream>
#include <stdio.h> 
#include <math.h>
#include <string.h>
#include <algorithm>
#define LL long long
#define GG int 
#define For(i, j, k) for(int i=j; i<=k; i++)
#define Dow(i, j, k) for(int i=j; i>=k; i--)
using namespace std;
const int N = 1011; 
int n, m;
int f[N]; 

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

int main() {
    while(~scanf("%d", &n)){
    	if(n == 0) 
    		return 0; 
		int x, y, ans = n-1; 
		For(i, 1, 1000) f[i] = i; 
		scanf("%d", &m); 
        For(i, 1, m) {
        	scanf("%d%d", &x, &y); 
        	if(x>n || y>n) continue; 
        	int xx = find(x), yy = find(y); 
			if(xx != yy) f[yy] = xx, ans--;  
		} 
		printf("%d\n", ans);
    }
    return 0;
}