#include<iostream>
#include<string>
#include<cstring>
using namespace std;
int find(int a[],int ff)
{
int i;
int min;
if(ff>=1)
{
min=a[0];
for(i=0;i<=ff;i++)
{
if(a[i]<min)
min=a[i];
}
return min;
}
else
return a[0];
}
int main()
{
string s1,s2;
int cases=0;
int t;
int i,j,k;
cin>>t;
int distance;
int temp[100005];
int ff=0;
int point=0;
while(t--)
{
ff=0;
k=0;
cin>>s1;
cin>>s2;
distance=s2.length();
point=0;
memset(temp,distance,sizeof(temp));
temp[point]=distance;
for(i=0;i<s1.length()&&ff<s2.length();i++)
{
distance=s2.length();
if(s1[i]==s2[ff])
{
k=ff+1;
distance--;
for(j=i+1;j<s1.length()&&k<s2.length();j++,k++)
{
if(s1[j]==s2[k])
distance--;
}
}
else
continue;
k=0;
temp[point++]=distance;
if(i==s1.length()-1&&ff<s2.length())
{
i=-1;
ff++;
}
}
int ans=find(temp,point);
cout<<"Case #"<<++cases<<": "<<ans<<endl;
}
return 0;
}