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.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.Vector;


public class Recycled {
	public static void main(String[] args) throws FileNotFoundException {

		Scanner in = new Scanner(new FileReader(new File("C-small-attempt0.in")));
		
		PrintWriter out = new PrintWriter(new File("C-small-attempt0.out"));
		
		int t = in.nextInt();
		in.nextLine();
		
		for(int i=0; i<t; i++) {
			int a = in.nextInt();
			int b = in.nextInt();
			int l = Integer.toString(a).length();
			int r = 0;
			

//			System.out.println("a="+a+"\tb="+b);
			
			Vector<Integer> sub = new Vector<Integer>(20); 
			
			for(int c=a; c<=b; c++) {
				String cs = Integer.toString(c);
				
				sub.removeAllElements();

				for(int k=1; k<l;k++) {
					cs = cs.substring(1) + cs.charAt(0);
					if (cs.charAt(0) == '0') continue;

					int ns = Integer.parseInt(cs);
					if (ns > c && ns <= b && !sub.contains(ns)) {
						sub.add(ns);
						r++;
//						System.out.println(c+" -> "+ns);
					}
				}
//				System.out.println("......");
			}
			
			System.out.println("Case #" + (i+1)+ " of "+t+": " + r);
//			System.out.println("==================");
			
			out.println("Case #" + (i+1)+ ": " + r);
		}
		out.close();
	}
}
