
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.File;
import java.util.HashMap;
import java.util.Scanner;


public class ProblemC {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws Exception {
		
		Scanner leitor = new Scanner(new File("problemC.in"));
		int n = leitor.nextInt(); leitor.nextLine();
		for (int caso = 0 ; caso < n; caso++) {
			int a = leitor.nextInt();
			int b = leitor.nextInt();
			leitor.nextLine();
			/* A â¤ n < m â¤ B. */
			if (b > 10) { 
				int resultado[] = new int[b+1];
				for (int i = 0; i < 11; i++) {
					resultado[i] = 0;
				}
				for (int i = a; i <= b; i++) {
					String number = Integer.toString(i);
					int resultadoParcial = resultado[i-1];
					String numberToChange = Integer.toString(i);
					HashMap<Integer, Integer> tiraRepetidos = new HashMap<Integer, Integer>();
					for (int j = 0; j < number.length()-1; j++) {
						String novoNumeroString = numberToChange.substring(j+1) + numberToChange.substring(0,j+1);
						while (novoNumeroString.startsWith("0")) novoNumeroString = novoNumeroString.substring(1);
						int novoNumero = new Integer( novoNumeroString);
						//System.out.println(i + " -> " + novoNumero);
						if (!tiraRepetidos.containsKey(novoNumero)) {
							if ((a <= i ) && 
							(i < novoNumero) && (novoNumero <= b)) {
								resultadoParcial += 1;
							}
							tiraRepetidos.put(novoNumero, novoNumero);
						}
					}
					resultado[i] = resultadoParcial;	
				}
				System.out.println("Case #"+ (caso+1) + ": " + (resultado[b])); 
			} else {
				System.out.println("Case #"+ (caso+1) + ": 0"); 

			}

		}
	}

}
