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.util.ArrayList;
import java.util.Scanner;
import java.io.*;

/**
 * 
 */

/**
 * @author Daniel
 *
 */
public class Recycled {

	
	public static ArrayList<Integer> generateRecycled(int seed){
		String seeds = Integer.toString(seed);
		ArrayList<Integer> recycled = new ArrayList<Integer>();
		Integer temp;
		for (int i = 1; i < seeds.length(); i++){
			temp = Integer.parseInt(seeds.substring(i) + seeds.substring(0, i));
			if (temp.intValue()!=seed && !recycled.contains(temp))
				recycled.add(temp);
		}
		return recycled;
	}
	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		
		if (args.length!=2){
			System.err.println("Error with arguments");
			System.exit(-1);
		}
			
		// Configuring input and output
		Scanner input = new Scanner(new FileReader(new File(args[0])));
		Writer output = new BufferedWriter(new FileWriter(new File(args[1])));
		
		int T = input.nextInt();
		int A, B, count, temp;		
		for (int i = 1; i <= T; i++){
			System.out.print("Case #" + i + ": ");
			output.write("Case #" + Integer.toString(i) + ": ");
			
			A = input.nextInt();
			B = input.nextInt();
			count = 0; temp = 0;
			ArrayList<Integer> found = new ArrayList<Integer>();
			
			for (int j = A; j <= B; j++){
				if (found.contains(Integer.valueOf(j)))
					continue;
				ArrayList<Integer> recycled = new ArrayList<Integer>(generateRecycled(j));
				temp = 0;
				for (Integer e :recycled){
					if ((e.intValue() >= A) && (e.intValue() <= B)){
						found.add(e);
						temp ++;
					}
				}
				if (temp > 0){
					count += temp * (temp+1) / 2;
				}
				
			}
			System.out.print(count);
			output.write(Integer.toString(count));
			
			System.out.println();
			output.write("\n");
		}
		output.close();

	}

}
