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.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;


public class B {
	public static void main(String args[]) throws FileNotFoundException{
		//Scanner scanner = new Scanner(new FileInputStream("input.in"));
		Scanner scanner = new Scanner(System.in);
		int nt = scanner.nextInt();
		scanner.nextLine();
		//PrintWriter printWriter = new PrintWriter(new FileOutputStream("output.out"));
		PrintWriter printWriter = new PrintWriter(System.out);

		for (int i = 0; i < nt; i++) {
			printWriter.print("Case #"+(i+1)+": ");
			printWriter.println(solveIt(scanner.nextLine()));
		}
		printWriter.close();
		
	}

	private static String solveIt(String nextLine) {
		List<String> list= new ArrayList<String>(); 
		int A = Integer.parseInt(nextLine.split(" ")[0]);
		int B = Integer.parseInt(nextLine.split(" ")[1]);
		int result = 0;
		for (int i = A; i < B; i++) {
			String k = ""+i;
			for (int j = 0; j < k.length()-1; j++) {
				String k1 = k.substring(k.length()-(j+1), k.length()) + k.substring(0,k.length()-(j+1));
				if(Integer.parseInt(k1) > i && Integer.parseInt(k1) <= B){
					if(!list.contains(i+"--"+k1)){
						list.add(i+"--"+k1);
						result++;	
					}
				}	
			}
		}
		return result+"";
	}
}
