import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;

public class Recycle {

	private static HashMap<Integer, HashSet<Integer>> map = new HashMap<Integer, HashSet<Integer>>();
	private static HashSet<Integer> toSkip = new HashSet<Integer>();
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner reader = new Scanner(System.in);
		int T = reader.nextInt();
		for (int tc = 1; tc <= T; tc++) {
			int a = reader.nextInt();
			int b = reader.nextInt();
			long before = System.currentTimeMillis();
			int res = doit(a, b);
			System.out.printf("Case #%d: %d\n", tc, res);
			long after = System.currentTimeMillis();
//			System.out.println("time taken: " + (after - before));
		}
	}

	private static int doit(int a, int b) {
		int count = 0;
		HashSet<Integer> skip = new HashSet<Integer>(toSkip);
		for (int i = a; i <= b; i++) {
			if (skip.contains(i))
				continue;
			HashSet<Integer> arr = generate(i);
//			if(arr.size() > 1) {
//				map.put(i, arr);
//			}
			// System.out.println(i + " --> " +
			// Arrays.deepToString(arr.toArray()));
			int temp = 0;
			if (arr.size() > 1) {
				for (int x : arr) {
					if (x >= a && x <= b) {
						temp++;
						skip.add(x);
					}
				}
				count += temp * (temp - 1) / 2;
			}
//			System.out.println("not skipping " + i + " gen: " + arr.size()+ " " + (temp * (temp - 1) / 2));
		}
		return count;
	}

	private static HashSet<Integer> generate(int num) {
		if(map.containsKey(num)) {
			HashSet<Integer> list = map.get(num);
			return list;
		}
		HashSet<Integer> list = new HashSet<Integer>();
		String s = "" + num;
		list.add(num);
		int len = s.length();
		for (int i = 1; i < len; i++) {
			String temp = s.substring(i) + s.substring(0, i);
			// System.out.println("temp: " + temp);
			if (temp.charAt(0) == '0')
				continue;
			int x = Integer.parseInt(temp);
			if( x <= 2000000) {
				list.add(x);
			}
		}
		if(list.size() > 1) {
			map.put(num, list);
		} else {
			toSkip.add(num);
		}
		return list;
	}

}

import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.Vector;


public class recycle {

	
	public static void main(String arg[]) throws FileNotFoundException
	{
		Scanner in=new Scanner(new FileReader("rec.in"));
		PrintWriter pw=new PrintWriter("ansRec.txt");
		int cases=in.nextInt();
		in.nextLine();
		
		for(int counter=1;counter<=cases;counter++)
		{
			int small=in.nextInt();
			int large=in.nextInt();
			
			int ans=0;

			for(int i=small;i<large;i++)
			{
				int length=(int)(Math.log10(i))+1;
								
				boolean flag=false;
				int label=i%10;
				int temp=i;
				
				for(int j=0;j<length;j++)
				{
					if(temp%10!=label)
					{
						flag=true;
						break;
					}
					else
					{
						temp=temp/10;
					}
				}
				
				boolean f2=false;
				
				Vector<Integer> vec=new Vector<Integer>();
				
				for(int j=1;j<length&&flag;j++)
				{
					int exponent=(int) (Math.pow(10,j));
					int lead=(int) (i/exponent);
					int residual=(i%exponent);
					
					if(residual/(exponent/10)==0)
						continue;
					
					int newI=(int) (Math.pow(10, (int)(Math.log10(lead)+1))*residual+lead);
					if(newI>i&&newI<=large&&!vec.contains(newI))
					{
						ans++;
//						System.out.print("("+i+", "+newI+") -- ");
						vec.add(newI);
						f2=true;
					}
					
//					System.out.println("for "+i+" checking with "+newI);
				}
//				if(f2) System.out.println();
				
			}
			
			pw.println("Case #"+counter+": "+ans);

		}
		pw.close();
	}
}
