
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
import java.io.File;
import java.io.IOException;
import java.io.FileWriter;
import java.io.BufferedWriter;

public class Recycle
{
	public static void main(String[] args)
	{
/*		Set<Integer> perms = getPermutations(123456);
		
		for(Integer i: perms)
			System.out.println(i);*/
	
		try
		{
			Scanner s = new Scanner(new File("recycle.in"));
			BufferedWriter w = new BufferedWriter(new FileWriter(new File("recycle.out")));
			int numCases = s.nextInt();
			s.nextLine();
			
			for(int n = 1;n <= numCases; n++)
			{
				int A = s.nextInt();
				int B = s.nextInt();
				int count = 0;
				for(int k = A; k <= B; k++)
				{
					count += getNumPairs(k, B);
				}
				
				w.write("Case #" + n + ": " + count + "\n");
			}
			
			w.flush();
			w.close();
		}
		catch (IOException e)
		{
			e.printStackTrace();
		}
	}
	
	public static int getNumPairs(int n, int B)
	{
		Set<Integer> possibles = getPermutations(n);
		int count = 0;
		for(Integer i : possibles)
			if(i > n && i <= B)
				count++;
		return count;
	}
	
	public static Set<Integer> getPermutations(int n)
	{
		Set<Integer> perms = new TreeSet<Integer>();
		char[] digits = String.valueOf(n).toCharArray();
		
		for(int firstPos = 1; firstPos < digits.length; firstPos++)
		{
			String toBuild = "";
			for(int k = 0; k < digits.length; k++)
				toBuild += digits[(firstPos + k) % digits.length];
			perms.add(Integer.parseInt(toBuild));
		}
		return perms;
	}
	

}
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.concurrent.Callable;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.Future;

public class C {
	public static void main(String[] args) throws Exception {

		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		int n = Integer.parseInt(in.readLine());

		ExecutorService es = Executors.newFixedThreadPool(Math.min(8, n));
		@SuppressWarnings("unchecked")
		Future<Integer>[] fs = new Future[n];

		for (int i = 0; i < n; i++) {
			String[] parts = in.readLine().split(" ");
			final int A = Integer.parseInt(parts[0]);
			final int B = Integer.parseInt(parts[1]);

			fs[i] = es.submit(new Callable<Integer>() {
				public Integer call() {
					return wastetime(A, B);
				}
			});

		}
		for (int i = 0; i < n; i++) {
			System.out.println("Case #" + (i + 1) + ": " + fs[i].get());
		}
		es.shutdown();

	}

	public static int wastetime(int A, int B) {
		HashSet<Long> answers = new HashSet<Long>();
		int len = (int) Math.log10(A) + 1;
		int m;
		int div = (int) Math.pow(10, len - 1);
		if (div <= 0) {
			return 0;
		}

		for (int n = A; n < B; n++) {
			m = n;
			for (int i = 0; i < len; i++) {
				m = ((m % div) * 10) + m / div;
				if (m > n && m <= B) {
					long ans = ((n & 0xFFFFFFFFl) << 32) + m;
					//System.out.println(Long.toHexString(ans));
					answers.add(ans);
				}
			}
		}
		return answers.size();//

		// return div;
	}
}