import java.util.HashSet;
import java.util.Scanner;

public class C {

	static HashSet p = new HashSet();
	static int low;
	static int high;
	int count = 0;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int no = sc.nextInt();

		for (int i = 1; i <= no; i++) {

			p.clear();
			low = sc.nextInt();
			high = sc.nextInt();

			for (int l = low; l <= high; l++) {
				recycle(l);
			}
			System.out.println("Case #" + i + ": " + p.size());

		}
	}

	public static void recycle(int no) {

		String s = Integer.toString(no);
		for (int i = 0; i < s.length(); i++) {
			String rec = s.substring(i) + s.substring(0, i);
			int r = Integer.parseInt(rec);
			if (r != no && r >= low && r <= high) {
				int min = Math.min(r, no);
				int max = Math.max(r, no);
				String a = Integer.toString(min) + "" + Integer.toString(max);
				p.add(a);

			}
		}

	}
}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package problem.c.recycled.numbers;

import java.io.File;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Scanner;

/**
 *
 * @author Park
 */
public class ProblemCRecycledNumbers {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws IOException {
        PrintStream out = new PrintStream(new File("/Users/Park/Desktop/output.txt"));
        Scanner in = new Scanner(new File("/Users/Park/Desktop/C-large.in"));
        int testCase = Integer.parseInt(in.next());
        for (int n = 0; n < testCase; n++) {
            int count = 0;
            //
            int start = Integer.parseInt(in.next());
            int end = Integer.parseInt(in.next());
            for (int i = start; i <= end; i++) {
                boolean chk = true;
                String num = i + "";
                int numLength = num.length();
                int[] alreadySearch = new int[numLength - 1];
                for (int j = 1; j < numLength; j++) {
                    String f = num.substring(0, j);
                    String b = num.substring(j);
                    int search = Integer.parseInt(b + f);
                    for (int k = 0; k < j - 1; k++) {
                        if (search == alreadySearch[k]) {
                            chk = false;
                            break;
                        }
                        chk = true;
                    }
                    alreadySearch[j - 1] = search;
                    if (chk && (search + "").length() == numLength && search != i && search >= start && search <= end) {
                        count++;
                    }
                }
            }
            out.println("Case #" + (n + 1) + ": " + count / 2);
            System.out.println("Case #" + (n + 1) + ": " + count / 2);
        }
        in.close();
        out.close();
    }
}
