import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashSet;
import java.util.Set;

/**
 * 
 */

/**
 * @author antonio081014
 * @time: Apr 13, 2012, 5:01:31 PM
 */
public class Main {

    /**
     * @param args
     */
    public static void main(String[] args) throws Exception {
        Main main = new Main();
        main.run();
        System.exit(0);
    }

    public void run() throws Exception {
        BufferedReader br = new BufferedReader(new FileReader("input.in"));
        BufferedWriter out = new BufferedWriter(new FileWriter("output.out"));
        int T = Integer.parseInt(br.readLine());
        for (int t = 1; t <= T; t++) {
            out.write("Case #" + Integer.toString(t) + ": ");
            String[] strs = br.readLine().split("\\s");
            int A = Integer.parseInt(strs[0]);
            int B = Integer.parseInt(strs[1]);

            Set<Integer> set;

            int count = 0;
            for (int n = A; n <= B; n++) {
                String tmp = Integer.toString(n);
                set = new HashSet<Integer>();
                for (int i = 0; i < tmp.length(); i++) {
                    String a = tmp.substring(i) + tmp.substring(0, i);
                    int m = Integer.parseInt(a);
                    if (m > n && m <= B) {
                        set.add(m);
                    }
                }
                count += set.size();
            }
            out.write(Integer.toString(count) + "\n");
        }
        out.close();
    }
}