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.BufferedReader;
import java.io.File;
import java.util.HashMap;
import java.util.StringTokenizer;
import java.io.FileReader;
public class C {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws Exception  {
		BufferedReader reader = null;
		String fileName = "C-small-attempt2.in";
		String outputFileName=fileName.replace(".in", ".out");
		reader=new BufferedReader(new FileReader(fileName));
		File outFile=new File(outputFileName);
		outFile.createNewFile();
		int T = Integer.parseInt(reader.readLine());
		for (int i = 1; i <=T; i++) {
			StringTokenizer t=new StringTokenizer(reader.readLine()," ");
			int start=Integer.parseInt(t.nextToken());
			int end=Integer.parseInt(t.nextToken());
			int count=0;
			HashMap<String,String> map=new HashMap<String,String>();
			for(int j=start;j<end;j++){
				String s=j+"";
				for(int k=1;k<s.length();k++){
					String ss=s.substring(s.length()-k);
					String es=s.substring(0,s.length()-k);
					if(ss.startsWith("0"))continue;
					int num=Integer.parseInt(ss+""+es);
					if(num<=end && num>=start && num>j){
						String key=j+"_"+num;
						if(map.get(key)==null){
							map.put(key, key);
							count++;
						}
					}
				}
			}
			System.out.println("Case #"+i+": "+count);
		
		}

	}

}
