import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}


import java.util.*;
public class C {

	public static void main (String[] args)
	{	
			String bIn;
			Scanner in = new Scanner(System.in);
			
			int T = Integer.parseInt(in.nextLine());
			
			for (int test = 0 ; test < T ; test++)
			{
				String range = in.nextLine();
				String[] cIN = range.split(" ");
				int max = Integer.parseInt(cIN[1]);
				int min = Integer.parseInt(cIN[0]);
				int count = 0;
				for (int findPair = min ; findPair <= max ; findPair ++)
				{
					String thisOne = String.valueOf(findPair);
					
					String[] gothrough = thisOne.split("");
					int digitLength = gothrough.length-1;
					
					int sameTest = Integer.parseInt(thisOne);
					
				//	System.out.println(digitLength);
					
					for (int shuffle1 = 0 ; shuffle1 < digitLength ; shuffle1++)
					{
		
							String temp = thisOne.substring(shuffle1)+thisOne.substring(0,shuffle1);
						//	System.out.println(temp);
							
							int test1 = Integer.parseInt(temp);
							
							if (test1 <= max && test1 >= min && test1 != sameTest)
							{
							//	System.out.println(test1);
							//	System.out.println("( "+thisOne+","+test1+")");
								count++;
							}
			
					}
					
				}
				count = count/2;
				System.out.println("Case #"+(test+1)+": "+count);
			}

	}
	

}