var
n,m,x,y,i,ans,k:longint;
f:array[1..50000] of longint;
h:array[1..50000] of boolean;
function findset(x:longint):longint;
begin
if x<>f[x] then f[x]:=findset(f[x]);
exit(f[x]);
end;
procedure union(x,y:longint);
begin
x:=findset(x);
y:=findset(y);
if x<>y then
f[x]:=y;
end;
begin
k:=0;
while not eof do
begin
inc(k);
read(n,m);
fillchar(f,sizeof(f),0);
for i:=1 to n do
f[i]:=i;
for i:=1 to m do
begin
read(x,y);
union(x,y);
end;
fillchar(h,sizeof(h),false);
for i:=1 to n do
begin
f[i]:=findset(f[i]);
h[f[i]]:=true;
end;
ans:=0;
for i:=1 to n do
if h[i] then inc(ans);
if (n<>0) and (m<>0) then
writeln('Case ',k,': ',ans);
end;
end.