1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 #include<algorithm>
 5 #include<queue>
 6 #include<stack>
 7 #include<vector>
 8 using namespace std;
 9 const int INF=0x3f3f3f3f;
10 const int MAXN=1e6+10;
11 int pre[MAXN],prt[MAXN],num[MAXN];
12 int find(int x){
13     int r=x;
14     while(r!=pre[r])r=pre[r];
15     pre[x]=r;
16     return r;
17 }
18 void merge(int x,int y){
19     int f1,f2;
20     f1=find(x);f2=find(y);
21     if(f1!=f2){
22         pre[f2]=f1;
23     }
24 }
25 int n;
26 void initial(){
27     for(int i=0;i<=n;i++)pre[i]=i,prt[i]=i;
28     memset(num,0,sizeof(num));
29 }
30 int main(){
31     int m;
32     char s[5];
33     int a,b,flot=0;
34     while(~scanf("%d%d",&n,&m),n|m){
35         initial();
36         int k=n;
37         while(m--){
38         scanf("%s",s);
39         if(s[0]==‘M‘){
40             scanf("%d%d",&a,&b);
41             merge(prt[a],prt[b]);
42             }
43         else{
44                 scanf("%d",&a);
45                 prt[a]=k;
46                 pre[k]=k;
47                 k++;
48             }
49         }
50         int cnt=0;
51         for(int i=0;i<n;i++){
52             int t=find(prt[i]);
53             if(!num[t]){
54                 cnt++;
55                 num[t]=1;
56             }
57         }
58         printf("Case #%d: %d\n",++flot,cnt);
59     }
60     return 0;
61 }