
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.DataInputStream;
import java.io.FileInputStream;
import java.io.InputStreamReader;

public class MainApp {

	public static void main(String[] args) {
		String input = "";

		try {
			FileInputStream fstream = new FileInputStream("C-small-attempt2.in");

			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine;

			while ((strLine = br.readLine()) != null) {
				input += strLine + "\n";
			}
			in.close();
		} catch (Exception e) {
		}

		String[] inputs = input.split("\n");
		
		int len = inputs.length;
	
		for (int p = 1; p < len; ++p) {
			int count = 0;
			
			String[] split = inputs[p].split(" ");
			
			int A = Integer.parseInt(split[0]);
			int B = Integer.parseInt(split[1]);

			int n = A;
			
			while (n < B - 1) {
				for (int m = (n + 1); m <= B; ++m) {
					String strN = String.valueOf(n);
					
					for (int k = strN.length(); k > 1; --k) {
						String str = strN.substring(k - 1, strN.length()) + strN.substring(0, k - 1);

						int a = Integer.parseInt(str);
						
						if (a == m) {
							count++;
							break;
						}
					}
				}
				
				n++;
			}

			System.out.println("Case #" + p + ": " + count);
		}
	}
}
