import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

import java.util.Scanner;

public class ProblemC {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int testCases = Integer.parseInt(scanner.nextLine());

        for (int i = 1; i <= testCases; i++) {
            String[] inputs = scanner.nextLine().split("\\s");
            int A = Integer.parseInt(inputs[0]);
            int B = Integer.parseInt(inputs[1]);
            int result = solve(A, B);
            System.out.println("Case #" + i + ": " + result);
        }
    }

    private static int solve(int A, int B) {
        int recycledPairs = 0;

        for (int n = A; n < B; n++) {
            for (int m = n + 1; m <= B; m++) {
//                System.out.println("Checking pair " + n + " " + m);
                if (isRecycledPairs(n, m)) {
                    recycledPairs++;
                }
            }
        }

        return recycledPairs;
    }

    private static boolean isRecycledPairs(int n, int m) {

        boolean result = false;

        String nString = String.valueOf(n);
        String mString = String.valueOf(m);
        String recycledString = null;

        for (int i = 0; i < nString.length(); i++) {
            recycledString = nString.substring(i, nString.length()) + nString.substring(0, i);
//            System.out.println(recycledString);

            if (mString.equals(recycledString)) {
                result = true;
            }
        }

        return result;
    }
}
