#include<iostream>

 #include<cstdio>

 #include<queue>

 #include<algorithm>

 #include<cmath>

 #include<ctime>

 #include<set>

 #include<map>

 #include<stack>

 #include<cstring>

 #define inf 2147483647

 #define ls rt<<1

 #define rs rt<<1|1

 #define lson ls,nl,mid,l,r

 #define rson rs,mid+1,nr,l,r

 #define N 2000010

 #define For(i,a,b) for(int i=a;i<=b;i++)

 #define p(a) putchar(a)

 #define g() getchar()

 using namespace std;

 int n,m;

 char c;

 int d[N],id[N];

 int x,y;

 int cnt;

 int tot;

 set<int>s;

 void in(int &x){

     int y=;

     char c=g();x=;

     while(c<''||c>''){

         if(c=='-')y=-;

         c=g();

     }

     while(c<=''&&c>=''){

         x=(x<<)+(x<<)+c-'';c=g();

     }

     x*=y;

 }

 void o(int x){

     if(x<){

         p('-');

         x=-x;

     }

     if(x>)o(x/);

     p(x%+'');

 }

 int find(int x){

     if(d[x]==x)return x;

     return d[x]=find(d[x]);

 }

 int main(){

     while(cin>>n>>m&&(n+m)){

         For(i,,N)

             d[i]=i;

         For(i,,n-)

             id[i]=i;

         cnt=n;

         while(m--){

             cin>>c;

             if(c=='M'){

                 in(x);in(y);

                 int t1=find(id[x]);

                 int t2=find(id[y]);

                 if(t1!=t2)

                     d[t1]=t2;

             }

             if(c=='S'){

                 in(x);

                 id[x]=cnt++;

             }

         }

         s.clear();

         For(i,,n-)

             s.insert(find(id[i]));

         cout<<"Case #"<<++tot<<": "<<s.size()<<endl;

     }

     return ;

 }