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

/**
 * Created by IntelliJ IDEA.
 * User: tanin
 * Date: 4/14/12
 * Time: 9:54 AM
 * To change this template use File | Settings | File Templates.
 */
public class Recycled {


    public static void main(String[] args) throws Exception {

        String filename = "Recycled/recycled";
        String outFilename = filename + "_out";

        FileInputStream fis = new FileInputStream(new File(filename));
        Scanner input = new Scanner(new BufferedInputStream(fis));

        FileOutputStream fOut = new FileOutputStream(new File(outFilename));
        BufferedOutputStream bOut = new BufferedOutputStream(fOut);
        DataOutputStream out = new DataOutputStream(bOut);

        int numCases = input.nextInt();
        input.nextLine();

        for (int caseNumber=0;caseNumber<numCases;caseNumber++) {

            int a = input.nextInt();
            int b = input.nextInt();
            out.writeBytes("Case #" + (caseNumber+1) + ": " + solve(a, b) + "\n");
        }

        out.flush();
        out.close();

        bOut.flush();
        bOut.close();

        fOut.flush();
        fOut.close();
    }

    static boolean[] checked = new boolean[2000001];
    public static long solve(int a, int b) {

        for (int i=0;i<checked.length;i++) {
            checked[i] = false;
        }
        
        long count = 0;

        for (int number=a;number<=b;number++) {
        
            if (checked[number] == true) continue;

            int multiple = getMultiple(number);
            checked[number] = true;
            int countValid = 1;
            
            int run = next(number, multiple);
            while (run != number) {

                if (run >= multiple && a <= run && run <= b) {
                    checked[run] = true;
                    countValid++;
                    
                    //System.out.println(run);
                }
                
                run = next(run, multiple);
            }
            
            if (countValid == 1) continue;
            //System.out.println(number);
            
            count += countValid * (countValid - 1) / 2;
        }

        return count;
    }
    
    public static int getMultiple(int s)  {
        if (s < 10) return 1;
        else if (s < 100) return 10;
        else if (s < 1000) return 100;
        else if (s < 10000) return 1000;
        else if (s < 100000) return 10000;
        else if (s < 1000000) return 100000;
        else if (s < 10000000) return 1000000;
        else {
            System.out.println("Fuck you");
            return -100000000;
        }
    }
    
    public static int next(int s, int multiple) {
        int residue = s % 10;
        return residue * multiple + s / 10;
    }

}
