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

public class C{
	static ArrayList< ArrayList<Integer> > mem = new ArrayList< ArrayList<Integer> >();
	static int lenAB = -1;
	static boolean udah[] = new boolean[2000005];
		
	public static void compute(int x){
		int div = 10, gen, mul = 1;
		for (int i = 0 ; i < lenAB-1 ; i ++)mul*=10;
		HashSet<Integer> set = new HashSet<Integer>();
		while(mul > 1){
			gen = x/div + (x%div)*mul;
			if (x%div!=0 && x!=gen && !set.contains(gen)){
				mem.get(x).add(gen);
				set.add(gen);
			}
			div*=10;
			mul/=10;
		}
		udah[x] = true;
	}
	
	public static void main(String args[])throws Exception{
		for (int i = 0 ; i < 2000005 ; i ++){
			mem.add	(new ArrayList<Integer>());
			udah[i] = false;
		}
		
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer tok;
		String input;
		int t, a, b, sum = 0;
		
		t = Integer.parseInt(in.readLine());
		for (int k = 1 ; k <= t ; k ++){
			tok = new StringTokenizer(in.readLine());
			input = tok.nextToken();
			lenAB = input.length();
			a = Integer.parseInt(input);
			b = Integer.parseInt(tok.nextToken());
			sum = 0;
			for (int i = a ; i < b ; i ++){
				if (!udah[i]){
					compute(i);
				}
				int len = mem.get(i).size(), res;
				for (int j = 0 ; j < len ; j ++ ){
					res = mem.get(i).get(j);
					if (i < res && res <= b){
						sum++;
					}
				}
			}
			System.out.println("Case #" + k + ": " + sum);
		}
	}
}