import java.util.Scanner;
import java.io.*;
import java.lang.Math;


public class C{
	public static int recycle(String str){
		String[] numbers = str.split(" ");
		int min = Integer.parseInt(numbers[0]);
		int max = Integer.parseInt(numbers[1]);
		int ret = 0;

		for(int i = min; i < max; i++){
			String num = i + "";
			int len = num.length();
			int k = i;
			for(int j = 1; j < len; j++){
				k = (k/10) + (int)java.lang.Math.pow(10.0,(double)(len-1))*(k%10);
				if (k > i && k <= max)
					ret++;
				else if(k == i)
					break;
			}
		}

		return ret;
	}

	public static void main(String[] args){
		Scanner sc = null;
		String next;
		int out;
		try{
			sc = new Scanner(new File("C-large.in"));
			int cases = Integer.parseInt(sc.nextLine());
			int current = 0;
			

			FileWriter fs = new FileWriter("output.txt");
			BufferedWriter buff = new BufferedWriter(fs);
			while(current < cases){
				next = sc.nextLine();
				current++;
				out = recycle(next);
				buff.write("Case #" + current + ": " + out + "\n");
			}
			buff.close();
		}
		catch(Exception ex){}
	}
}
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.PrintStream;
import java.util.Scanner;

public class ProblemC {
	public static void main(String[] args) throws FileNotFoundException {
		PrintStream out = new PrintStream(new FileOutputStream(new File(
				"c-large.out")));
		Scanner in = new Scanner(new File("C-large.in"));

		int T = in.nextInt();

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

			int count = 0;

			// boolean[] visited = new boolean[B - A + 1];
			for (int n = A; n <= B; n++) {
				// if (!visited[n]) {
				String origstr = Integer.valueOf(n).toString();
				String str = shift(origstr);
				while (!str.equals(origstr)) {
					int shifted = Integer.parseInt(str);

					// System.out.printf("n: %d, shift: %s, shifted: %d, valid: %b\n",
					// n, str, shifted, shifted > n);

					if (shifted > n && shifted <= B)
						count++;

					str = shift(str);
				}
				// }
			}

			out.printf("Case #%d: %d\n", i, count);
		}

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

	public static String shift(String num) {
		return num.charAt(num.length() - 1)
				+ num.substring(0, num.length() - 1);
	}
}
