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 P03 {

	public static void main(String[] args) {
		Scanner inp = new Scanner(System.in);
		int t = inp.nextInt();
		inp.nextLine();
		int i = 1;
		while (t > 0) {
			int a = inp.nextInt();
			int b = inp.nextInt();

			System.out.println("Case #" + i + ": " + find(a, b));

			--t;
			++i;
		}

	}

	private static long find(int a, int b) {
		long ret = 0;
		boolean[] done = new boolean[b + 1];
		for (int i = a; i <= b; i++) {
			if (!done[i]) {
				Set<Integer> vals = new HashSet<Integer>();
				String is = String.valueOf(i);
				if (is.length() > 1) {
					vals.add(i);
					for (int j = 1; j < is.length(); j++) {
						String newS = is.substring(j) + is.substring(0, j);
						int newInt = Integer.parseInt(newS);
						if (newInt >= a && newInt <= b) {
							vals.add(newInt);
						}
					}
				}
				if (vals.size() > 1) {
					for (int val : vals) {
						done[val] = true;
					}
					ret += (vals.size() * (vals.size() - 1)) / 2;
				}
			}
		}
		return ret;
	}
}
