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.HashSet;
import java.util.Scanner;
import java.util.Set;

public class ProblemC {

	/**
	 * @param args
	 */
	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		String str = sc.nextLine();

		int T = Integer.valueOf(str);
		int[] A = new int[T];
		int[] B = new int[T];
		int[] res = new int[T];
		for (int i = 0; i < T; i++) {
			A[i] = sc.nextInt();
			B[i] = sc.nextInt();
		}

		for (int i = 0; i < T; i++) {
			
			for (int n = A[i]; n < B[i]; n++) {
				Set<String> pairs = new HashSet<String>();
				String jstr = String.valueOf(n);
				for (int j = 0; j < jstr.length() - 1; j++) {

					jstr = jstr.charAt(jstr.length() - 1)
							+ jstr.substring(0, jstr.length() - 1);
					int m = Integer.valueOf(jstr);

					if (n < m && m <= B[i]) {
						if (!pairs.contains(n + "," + m)) {
							pairs.add(n + "," + m);
							res[i]++;
						}
					}
				}

			}
			System.out.println("Case #" + (i + 1) + ": " + res[i]);
		}
	}

}
