package codejam;

import java.util.*;
import java.io.*;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

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();

	}

}
