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.*;
public class RecycledNums
{
    static Scanner cin = new Scanner(System.in);
    
    public static void main(String[] args)
    {
        String out = "";
        System.out.println("GO");
        int repeat = cin.nextInt();
        cin.nextLine();
        int ans=0;
        for(int i = 0; i < repeat; i++) {
            int in1 = cin.nextInt();
            int in2 = cin.nextInt();
            ans = findAns(in1, in2);
            out+="Case #" + (i+1) + ": " +ans+"\n";
        }
        System.out.println(out);
    }
    
    public static int findAns(int in1, int in2)
    {
        ArrayList<Integer> found = new ArrayList<Integer>();
        int ans = 0;
        for(int i = in1; i < in2; i++) {
            for(int j = i+1; j<=in2; j++) {
                int[] recycledNums = numsFor(i);
                for(int k = 0; k < recycledNums.length; k++) {
                    if((recycledNums[k]+"").length() == (j+"").length())
                        if(recycledNums[k] == j) {
                            /*boolean foundN = false;
                            for(int a = 0 ; a < found.size(); a++) {
                                if(j == found.get(a).intValue()) {
                                    foundN = true;
                                }
                            }
                            if(!foundN) {
                                ans++;
                                found.add(new Integer(j));
                            }*/
                            ans++;
                        }
                }
            }
        }
        return ans;
    }
    
    public static int[] numsFor(int in)
    {
        String num = in+"";
        int[] ans = new int[num.length()-1];
        for(int i = 1; i < num.length(); i++) {
            ans[i-1] = Integer.parseInt(num.substring(num.length()-i,num.length()) + num.substring(0,num.length()-i));
            for(int j = 0; j < i-1; j++) {
                if(ans[i-1] == ans[j])
                    ans[i-1] = 0;
            }
        }
        return ans;
    }
}
