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.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.Vector;

public class C {

	/**
	 * @param args
	 * @throws FileNotFoundException
	 */
	public static void main(String[] args) throws FileNotFoundException
	{
		Scanner scan = new Scanner(new File("C-small-attempt0.in"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		int cases = scan.nextInt();
		for (int r = 1; r <= cases; r++)
		{
			int a = scan.nextInt();
			int b = scan.nextInt();

			Vector<Integer>[] v = new Vector[b + 1];
			for (int i = 0; i < v.length; i++)
				v[i] = new Vector<Integer>();

			long ret = 0;
			for (int n = a; n <= b; n++)
			{
				String sn = n + "";
				for (int j = sn.length()-1; j > 0; j--)
				{
					String sm = sn.substring(j) + sn.substring(0, j);
					int m = Integer.parseInt(sm);
					sm = m + "";
					if (sm.length() == sn.length() && m <= b && m > n)
					{
						if (!v[n].contains(m))
						{
							v[n].add(m);
							v[m].add(n);
							ret++;
						}
					}
				}
			}
			out.println("Case #" + r + ": " + ret);
		}

		out.close();
		scan.close();
	}

}
