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.*;
import java.io.*;
import static java.lang.Math.*;

public class ProblemC {

	static int numLength(int x)
	{
		int ans = 0;
		while (x > 0)
		{
			ans ++;
			x /= 10;
		}
		return ans;
	}
	
	public static void main(String[] args) throws FileNotFoundException {
		Scanner fin = new Scanner(new File("C.txt"));
		PrintStream fout = new PrintStream("C.ans");
		int caseN = fin.nextInt();
		for (int caseI = 1; caseI <= caseN; caseI++)
		{
			int A = fin.nextInt();
			int B = fin.nextInt();
			int ans = 0;
			for (int n = max(A, 12); n < B; n++)
			{
				String front = Integer.valueOf(n / 10).toString();
				String back = Integer.valueOf(n % 10).toString();
				Set<Integer> appeared = new HashSet<Integer>();
				while (front.length() != 0)
				{
					if (back.charAt(0) != '0')
					{
						int m = Integer.valueOf(back + front);
						if (m > n && m <= B && !appeared.contains(m))
						{
							ans++;
							appeared.add(m);
							//fout.println(n + " " + m);
						}
					}
					back = front.charAt(front.length() - 1) + back;
					front = front.substring(0, front.length() - 1);
				}
			}
			fout.println("Case #" + caseI + ": " + ans);
		}
	}

}
