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;
	}

}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package codejam;

import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;

/**
 *
 * @author Aymen
 */
public class main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws IOException {

        int[] v = new int[1000];
        String outputFile = System.getenv("USERPROFILE") + "\\Documents\\C-small.out";
        String inputFile = System.getenv("USERPROFILE") + "\\Documents\\C-small.in";
        //String outputFile = System.getenv("USERPROFILE") + "\\Documents\\output.txt";
        //String inputFile = System.getenv("USERPROFILE") + "\\Documents\\input.txt";

        BufferedWriter os = new BufferedWriter(new FileWriter(outputFile));
        DataInputStream is = new DataInputStream(new FileInputStream(inputFile));

        int T = Integer.valueOf(is.readLine());

        System.out.println("T " + T);

        for (int i = 0; i < T; i++) {
            String list = is.readLine();
            list += " ";
            int l = list.substring(0, list.indexOf(" ")).length();
            int A = Integer.valueOf(list.substring(0, list.indexOf(" ")));
            list = list.substring(list.indexOf(" ") + 1);
            int B = Integer.valueOf(list.substring(0, list.indexOf(" ")));
            list = list.substring(list.indexOf(" ") + 1);

            boolean exist = false;
            int num, result = 0;
            String numString, numRotate;
            v[0] = 0;
            for (int j = A; j <= B; j++) {
                num = j;
                for (int n = 0; n < result; n++) {
                    if (num == v[n]) {                                                
                    }
                }
                numString = String.valueOf(num);
                numRotate = numString;
                numRotate = numRotate.substring(l - 1) + numRotate.substring(0, l - 1);
                num = Integer.valueOf(numRotate);
                while (numRotate.substring(0, 1).equals("0")) {
                    numRotate = numRotate.substring(l - 1) + numRotate.substring(0, l - 1);
                }
                num = Integer.valueOf(numRotate);
                while ((num < A) || (num > B)) {
                    numRotate = numRotate.substring(l - 1) + numRotate.substring(0, l - 1);
                    num = Integer.valueOf(numRotate);
                }

                while (num != j) {
                    if ((!exist) && (num != j)) {
                        for (int m = j + 1; m <= B; m++) {                            
                            if (m == num) {
                                v[result] = m;
                                result++;
                            }
                        }
                    }                    
                    numRotate = numRotate.substring(l - 1) + numRotate.substring(0, l - 1);
                    num = Integer.valueOf(numRotate);
                    while (numRotate.substring(0, 1).equals("0")) {
                        numRotate = numRotate.substring(l - 1) + numRotate.substring(0, l - 1);
                    }
                    num = Integer.valueOf(numRotate);
                    while ((num < A) || (num > B)) {
                        numRotate = numRotate.substring(l - 1) + numRotate.substring(0, l - 1);
                        num = Integer.valueOf(numRotate);
                    }
                    
                }
            }

            int m = i + 1;
            os.write("Case #" + m + ": " + result);
            os.newLine();
        }
        is.close();
        os.close();
    }
}
