
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;
	}
	

}

public class Case {
	
	//Atrib
	public int ind;
	public double a;
	public double b;

	public String resolver() {
		StringBuilder s_out = new StringBuilder("Case #" + ind + ": ");
		
		int cont = 0;
		
		for(int n = (int) a;n<b+1;n++)
			for(int m = n+1;m<=b;m++){
				
				String nn = String.valueOf(n);
				String mm = String.valueOf(m);
//				nn = nn.replace("0", "");
//				mm = mm.replace("0", "");
				if(nn.length() == mm.length() 
						&& Double.parseDouble(nn) < Double.parseDouble(mm)){
					
//					System.out.println("---" + nn + " " + mm);
					
					for(int i=1;i<nn.length();i++){
						
						String aux = nn.substring(i, nn.length()) + nn.substring(0, i);
						if(aux.equals(mm)){
//							System.out.println("---" + nn + " " + mm);
//							System.out.println( aux);
							cont++;
							i = nn.length();
						}
					}
					
				}
			}
		
//		System.out.println(cont);
		s_out.append(cont);
		
		s_out.append("\n");
		return s_out.toString();
	}

}//endClass
