#include<iostream>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<cstdio>
#include<set>
using namespace std;
#define maxn 1000010
set<int> S;
int n,m,fa[maxn],id[maxn];
char s[2];
int find(int x)
{
      if(x!=fa[x])
            fa[x]=find(fa[x]);
      return fa[x];
}
void Union(int x,int y)
{
      int fx,fy;
      fx=find(x),fy=find(y);
      if(fx!=fy)
      {
            fa[fx]=fy;
      }
}
int main()
{
      int tt,a,b,cas=1;
      while(scanf("%d%d",&n,&m)!=EOF)
      {
            if(n==0&&m==0)
                  break;
            for(int i=0;i<=n;i++)
                  fa[i]=i,id[i]=i;
            int k=n+1;
            for(int i=0;i<m;i++)
            {
                  scanf("%s",s);
                  if(s[0]==‘M‘)
                  {
                        scanf("%d%d",&a,&b);
                        Union(id[a],id[b]);
                  }
                  else if(s[0]==‘S‘)
                  {
                        scanf("%d",&tt);
                        id[tt]=k;
                        fa[id[tt]]=id[tt];
                        k++;
                  }
            }
            S.clear();
            for(int i=0;i<n;i++)
            {
                  S.insert(find(id[i]));
            }
            printf("Case #%d: %d\n",cas,S.size());
            cas++;
      }
      return 0;
}