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.FileOutputStream;
import java.io.IOException;
import java.util.HashSet;
import java.util.Scanner;

public class Recycled {

	public static void main(String[] args) throws IOException {
		int T;
		Scanner sc = new Scanner(System.in);
		FileOutputStream out = new FileOutputStream("out.txt");
		T = sc.nextInt();
		sc.nextLine();
		for (int i = 0; i < T; i++) {
			HashSet<String> res = new HashSet<String>();
			int A = sc.nextInt();
			int B = sc.nextInt();
			for (int j = A; j <= B; j++) {
				String n = "" + j;
				for (int k = 1; k < n.length(); k++) {
					if (n.charAt(k) != '0') {
						String m = n.substring(k) + n.substring(0, k);
						if (j < Integer.valueOf(m) && Integer.valueOf(m) <= B)
							res.add(n + " " + m);
					}
				}
			}
			out.write(("Case #" + (i + 1) + ": " + res.size() + "\n").getBytes());

		}

	}

}