import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;

public class Recycle {

	private static HashMap<Integer, HashSet<Integer>> map = new HashMap<Integer, HashSet<Integer>>();
	private static HashSet<Integer> toSkip = new HashSet<Integer>();
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner reader = new Scanner(System.in);
		int T = reader.nextInt();
		for (int tc = 1; tc <= T; tc++) {
			int a = reader.nextInt();
			int b = reader.nextInt();
			long before = System.currentTimeMillis();
			int res = doit(a, b);
			System.out.printf("Case #%d: %d\n", tc, res);
			long after = System.currentTimeMillis();
//			System.out.println("time taken: " + (after - before));
		}
	}

	private static int doit(int a, int b) {
		int count = 0;
		HashSet<Integer> skip = new HashSet<Integer>(toSkip);
		for (int i = a; i <= b; i++) {
			if (skip.contains(i))
				continue;
			HashSet<Integer> arr = generate(i);
//			if(arr.size() > 1) {
//				map.put(i, arr);
//			}
			// System.out.println(i + " --> " +
			// Arrays.deepToString(arr.toArray()));
			int temp = 0;
			if (arr.size() > 1) {
				for (int x : arr) {
					if (x >= a && x <= b) {
						temp++;
						skip.add(x);
					}
				}
				count += temp * (temp - 1) / 2;
			}
//			System.out.println("not skipping " + i + " gen: " + arr.size()+ " " + (temp * (temp - 1) / 2));
		}
		return count;
	}

	private static HashSet<Integer> generate(int num) {
		if(map.containsKey(num)) {
			HashSet<Integer> list = map.get(num);
			return list;
		}
		HashSet<Integer> list = new HashSet<Integer>();
		String s = "" + num;
		list.add(num);
		int len = s.length();
		for (int i = 1; i < len; i++) {
			String temp = s.substring(i) + s.substring(0, i);
			// System.out.println("temp: " + temp);
			if (temp.charAt(0) == '0')
				continue;
			int x = Integer.parseInt(temp);
			if( x <= 2000000) {
				list.add(x);
			}
		}
		if(list.size() > 1) {
			map.put(num, list);
		} else {
			toSkip.add(num);
		}
		return list;
	}

}

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

	}

}
