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.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
import java.util.StringTokenizer;

public class ProblemC {

	private static final String OUT = "C:/workspaces/tc/CodeJam/src/C.out";
	private static final String IN = "D:/downloads/C-small-attempt0.in";

	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new FileReader(IN));
		BufferedWriter bw = new BufferedWriter(new FileWriter(OUT));
		int T = Integer.parseInt(br.readLine());
		for (int i = 0; i < T; i++) {
			StringTokenizer st = new StringTokenizer(br.readLine());
			String num = st.nextToken();
			int k = num.length();
			int A = Integer.parseInt(num);
			int B = Integer.parseInt(st.nextToken());
			int res = 0;
			int mult = 1;
			for (int j = 0; j < k - 1; j++) {
				mult *= 10;
			}
			Map<Integer, Set<Integer>> map = new HashMap<Integer, Set<Integer>>(2000000);
			for (int j = A; j <= B; j++) {
				int t = j;
				for (int l = 0; l < k - 1; l++) {
					int rem = t % 10;
					t = rem * mult + t / 10;
					if (t > j && t <= B && t >= A) {
						Set<Integer> set = map.get(j);
						if (set == null) {
							set = new HashSet<Integer>(6);
						}
						set.add(t);
						map.put(j, set);
					}
				}
			}
			for (Entry<Integer, Set<Integer>> entry : map.entrySet()) {
				res += entry.getValue().size();
			}
			bw.write("Case #" + (i + 1) + ": " + res + "\n");
		}
		bw.close();
	}
}
