package qual;

import java.util.Scanner;

public class RecycledNumbers {

	public static void main(String[] args) {
		new RecycledNumbers().run();

	}

	private void run() {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int t = 0; t < T; t++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			int result = solve(A, B);
			System.out.printf("Case #%d: %d\n", t + 1, result);
		}
	}

	public int solve(int A, int B) {
		int result = 0;
		for (int i = A; i <= B; i++) {
			int dig = (int) Math.log10(A/*same as B*/) + 1;
			int aa = i;
			for (int d = 0; d < dig - 1; d++) {
				aa = (aa % 10) * (int)Math.pow(10, dig - 1) + (aa / 10);
				if (i == aa) {
					break;
				}
				if (i < aa && aa <= B) {
//					System.out.printf("(%d, %d) ", i, aa);
					result++;
				}
			}
		}
		return result;
	}

}

import java.util.*;
import java.io.*;

public class Recycled
{
	public static void main(String[] sArgs)throws IOException
	{
		Scanner oScan = new Scanner(new File("recycled.in"));
		PrintWriter out = new PrintWriter("recycled.out");

		int o_0 = oScan.nextInt();oScan.nextLine();
		for(int o_o=1;o_o<=o_0;o_o++)
		{
			int A = oScan.nextInt(),B=oScan.nextInt();
			int count=0,base=0;
			for(int i=1;i<=A;i*=10)base+=i;
			for(int i=A;i<B;i++)
			{
				String s = new String(i+"");
				ArrayList<Integer> nums = new ArrayList<Integer>();
				if(i%base==0)
				{
					//System.out.println("same "+i);
					continue;
				}
				for(int j=1;j<s.length();j++)
				{
					String newS = s.substring(j)+s.substring(0,j);
					if(newS.charAt(0)=='0')continue;
					int rec = new Integer(newS);
					if(rec>i&&rec<=B&&!nums.contains(rec)){count++;nums.add(rec);}
				}
			}
			out.println("Case #"+o_o+": "+count);
		}

		out.close();
	}
}