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.Scanner;

class RecycledNumbers {

    Scanner s = new Scanner(System.in);

    public static void main(String args[]) {
	    RecycledNumbers p = new RecycledNumbers();
	    p.run();
	}
	
	void run() {
	    int nCases = s.nextInt();
		for (int i=0; i<nCases; i++) {
		    int A = s.nextInt();
			int B = s.nextInt();
			System.out.println("Case #"+(i+1)+": "+count(A, B));
		}
	}

    int count(int A, int B) {
	    boolean[] dids = new boolean[B-A+1];
        int count = 0;
		int rotates = Integer.toString(A).length() - 1;
		int level = (int) Math.pow(10, rotates);

	    for (int i=A; i<B; i++) {
		    if (dids[i-A]) continue;
			int possibility = countPossibility(i, A, B, rotates, level, dids);
            if (possibility>1) count+=(possibility *(possibility-1)) / 2;			
		}
		return count;
	}

	int countPossibility(int v, int A, int B, int rotates, int level, boolean[] dids) {
	    int count = 1;
		dids[v-A] = true;
		
        for (int i=0; i<rotates; i++) {
		    int leftMost= v / level;
			v = (v % level) * 10 + leftMost;
			if (v<A || v>B) continue;
			if (dids[v-A]) continue;
			dids[v-A] = true;
			count++;
		}
    	return count;
	}
}