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.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashMap;
import java.util.Scanner;

public class Main {

	/**
	 * @param args
	 * @throws IOException
	 */
	public static void main(String[] args) throws IOException {
		Scanner input = new Scanner(new File("C-small-attempt0.in"));
		FileWriter out = new FileWriter("out.txt");

		int lineNumber = input.nextInt();
		for (int i = 0; i < lineNumber; i++) {
			int a = input.nextInt();
			int b = input.nextInt();
			int count = 0;
			int div = 1;
			for (int j = a; j < b; j++) {
				for (int k = j + 1; k <= b; k++) {
					div = 1;
					int length = 0;
					while (j / div > 0) {
						length++;
						div *= 10;
					}
					int max = div;
					div = 10;
					if (j == 334 && k == 433)
						System.out.println(length+" "+max);
					for (int velicina = 0; velicina < length; velicina++) {
						if (j == 334 && k == 433) {
							System.out.println("---------");
							System.out.println(j % div + "	" + k / (max / div));
							System.out.println(k % (max / div) + "	" + j / (div));
						}
						if (j % div == k / (max / div)
								&& k % (max / div) == j / div) {
							count++;
							break;
						}
						div*=10;
					}

				}
			}
			String solution = "Case #" + (i + 1) + ": " + count;
			solution += System.getProperty("line.separator");
			out.write(solution);

		}
		out.close();
		input.close();
	}
}
