2681

// include file
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <ctime>

#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <bitset>

#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <list>
#include <functional>

using namespace std;

// typedef
typedef __int64 LL;

// 
#define read freopen("in.txt","r",stdin)
#define write freopen("out.txt","w",stdout)

#define Z(a,b) ((a)<<(b))
#define Y(a,b) ((a)>>(b))

const double eps = 1e-6;
const double INFf = 1e100;
const int INFi = 1000000000;
const LL INFll = (LL)1<<62;
const double Pi = acos(-1.0);

template<class T> inline T sqr(T a){return a*a;}
template<class T> inline T TMAX(T x,T y)
{
	if(x>y) return x;
	return y;
}
template<class T> inline T TMIN(T x,T y)
{
	if(x<y) return x;
	return y;
}
template<class T> inline T MMAX(T x,T y,T z)
{
	return TMAX(TMAX(x,y),z);
}
template<class T> inline T MMIN(T x,T y,T z)
{
	return TMIN(TMIN(x,y),z);
}
template<class T> inline void SWAP(T &x,T &y)
{
	T t = x;
	x = y;
	y = t;
}


// code begin
char in1[60010],in2[60010];
int T,dp[258],s1,s2;
int main()
{
	read;
	write;
	scanf("%d",&T);
	getchar();
	int cas=1;
	while(T--)
	{
		
		gets(in1);
		gets(in2);
		//scanf("%s %s",in1,in2);
		memset(dp,0,sizeof(dp));
		s1 = strlen(in1);
		s2 = strlen(in2);
		for(int i=0;i<s1;i++)
			dp[in1[i]]++;
		for(int i=0;i<s2;i++)
			dp[in2[i]]--;
		int ans = 0;
		for(int i=0;i<258;i++)
			ans += abs(dp[i]);
		printf("Case #%d:  %d\n",cas++,ans);
	}
	return 0;
}