import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;

public class Recycled {
	public static void main(String[] args) throws Exception{
		String inputFile = "C-small-attempt0.in";
		
		BufferedReader input = new BufferedReader(new InputStreamReader(new FileInputStream(inputFile)));
		BufferedWriter output = new BufferedWriter(new OutputStreamWriter(new FileOutputStream("output")));
		long num_cases = Long.parseLong(input.readLine());
		int current_case = 0;
		
		while (current_case < num_cases){
			current_case++;
			
			String[] fields = input.readLine().split(" ");
			int A = Integer.parseInt(fields[0]);
			int B = Integer.parseInt(fields[1]);
			int total = 0;
			
			for (int n = A; n < B; n++){
				for (int m = n+1; m <= B; m++){
					if (isRecycled(n,m)) total++;
				}
			}
			
			System.out.println("Case #" + current_case + ": " + total);
			output.write("Case #" + current_case + ": " + total + "\n");
		}
		output.close();
	}

	private static boolean isRecycled(int n, int m) {
		String sn = ""+n;
		String sm = ""+m;
		if (sn.length() != sm.length()) return false;
		int totaln = 0, totalm = 0;
		for (int i = 0; i < sn.length(); i++){
			totaln += sn.charAt(i);
			totalm += sm.charAt(i);
		}
		if (totaln != totalm) return false;
		for (int i = 0; i < sn.length()-1; i++){
			sm = sm.charAt(sm.length() - 1) + sm.substring(0, sm.length() - 1);
			if (sm.equals(sn)) return true;
		}
		return false;
	}
}

import java.io.File;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class C {
	static long calc(long A, long B) {
		long d[] = new long[100];
		long res = 0;
		for (long a = A; a<=B; a++) {
			long t = a;
			int n = 0;
			while (t > 0) {
				d[n++] = (t % 10);
				t /= 10;
			}
			Set<Long> set = new HashSet<Long>(); 
			for (int i=1; i<n; i++) {
				if (d[i-1]==0) continue;
				long b = 0;
				for (int j=i-1; j>=0; j--)
					b = b*10 + d[j];
				for (int j=n-1; j>=i; j--)
					b = b*10 + d[j];				
				if (a < b && b <= B && !set.contains(b)) {
					res++;
					set.add(b);
				}
			}
		}
		return res;
	}
	public static void main(String[] args) throws Exception {
		/*System.out.println(calc(10, 40));
		System.out.println(calc(1, 9));
		System.out.println(calc(100, 500));
		System.out.println(calc(1111, 2222));
		for (int i =0; i<50; i++)
			System.out.println(calc(1000000, 2000000));*/
		Scanner scanner = new Scanner(new File("c.in"));
		int T = scanner.nextInt();
		PrintWriter pw = new PrintWriter(new File("c.out"));
		for (int i=0; i<T; i++) {
			pw.printf("Case #%d: ", i+1);
			long a = scanner.nextLong(),
					b = scanner.nextLong();
			pw.println(calc(a, b));
		}
		pw.close();
	}
}
