
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.*;
import java.util.HashSet;

public class Main {
	public static void main(String[] args) throws Exception {
		BufferedReader bf = new BufferedReader(new FileReader(new File("C-small-attempt1.in")));
		BufferedWriter bw = new BufferedWriter(new FileWriter(new File("C-small-attempt1.out")));

		int T = Integer.parseInt(bf.readLine());
		for (int c = 0; c < T; c++) {
			HashSet<String> set = new HashSet<String>();

			String tokens[] = bf.readLine().split(" ");
			int A = Integer.parseInt(tokens[0]), B = Integer.parseInt(tokens[1]), ans = 0;
			for (int I = A; I < B; I++) {
				String i = I + "";
				for (int j = 1; j < i.length(); j++) {
					String re = i.substring(j) + i.substring(0, j);
					if (I < Integer.parseInt(re) && Integer.parseInt(re) <= B) {
						if (!set.contains(i + "-" + re)) ans++;
						
						set.add(i + "-" + re);
					}
				}
			}
			bw.write(String.format("Case #%d: %d\n", c + 1, ans));
		}
		bw.close();
	}
}
