/***********************************
Problem: POJ 2524 Ubiquitous Religions
Time: 266MS
Memory: 352K
Accepted Time: 2009-08-19 20:52:35
Tip: 并查集
http://hi.baidu.com/fandywang_jlu/blog/item/b49e40893ddbb0b00f244485.html
************************************/
#include <stdio.h>
int pre[50001];
void Init(int n)
{
for(int i=1;i<=n;i++)pre[i]=-1;
}
int Find(int x)
{
int p=x;
while(pre[p]>0)p=pre[p];
while(p!=x)
{
int t=pre[x];
pre[x]=p;
x=t;
}
return p;
}
void Union(int x,int y)
{
x=Find(x);
y=Find(y);
if(x==y)return;
if(pre[x]<pre[y])pre[x]+=pre[y],pre[y]=x;
else pre[y]+=pre[x],pre[x]=y;
}
int main()
{
int n,m,Case=1;
while(scanf("%d%d",&n,&m),n+m!=0)
{
int t1,t2;
Init(n);
while(m--)
{
scanf("%d%d",&t1,&t2);
Union(t1,t2);
}
int sum=0;
for(int i=1;i<=n;i++)
if(pre[i]<0)sum++;
printf("Case %d: %d/n",Case++,sum);
}
return 0;
}