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;

public class RecycledNumbers {
	static ArrayList<pair> list=new ArrayList<pair>();
	public static void main(String[] args) {
		int pow[]=new int[10];
		for(int i=0;i<10;i++){
			pow[i]=(int)Math.pow(10, i);
		}
		
		Scanner sc=new Scanner(System.in);
		int t=sc.nextInt();
		for(int i=0;i<t;i++){
			int a=sc.nextInt();
			int b=sc.nextInt();
			int ans=0;
			for(int n=a;n<=b;n++){
				int keta=0;
				for(int k=10;n/k>0;k*=10)
					keta++;
				list.clear();
				for(int k=0;k<keta;k++){
					int m=n/pow[k+1]+(n%pow[k+1])*pow[keta-k];
					if(n<m && m<=b){
						if(some(n,m)){
							list.add(new pair(n,m));
							ans++;
						}
					}
				}
			}
			System.out.println("Case #"+(i+1)+": "+ans);
		}
	}
	static boolean some(int n,int m){
		for(pair p : list){
			if(p.equals(n, m)){
				return false;
			}
		}
		return true;
	}
	static class pair{
		int n,m;
		public pair(int n,int m){
			this.n=n;
			this.m=m;
		}
		public boolean equals(int n,int m){
			return this.n==n && this.m==m;
		}
	}
}
