
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 Hehe {

	/**
	 * @param args
	 */
	public static int n(int A, int B){
		
		// TODO Auto-generated method stub
		int start=A;
		int end=B;
		int count=0;
		MyNumbers myNumbers = new MyNumbers();
		MyNumbers myCheck = new MyNumbers();
		for( int k = start; k<=end; k++)
		{
			int a =k;
			
			
			String s = Integer.valueOf(a).toString();
			for(int i=0; i<s.length(); i++)
			{
				CharSequence c = s.subSequence(0, i);
				String s2 = s.concat(c.toString());
				s2 = s2.substring(i);
				
				int n = Integer.parseInt(s2);

				if(n<=end && n>=start  && a!=n && !myCheck.numbers.contains(n))
				{
					//System.out.println(s+"  "+s2);
					myNumbers.add(n);
					myCheck.add(a);
					count++;
				}
				
			}
			//myNumbers.numbers.removeAll(myCheck.numbers);
			
		}
		
		System.out.println(myNumbers.numbers.size()+"  count: "+count);
		return count;

	}

}
