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


public class ThreadDispatcher{
	
	private static final int CORES = 8;
	private Vector<SolveThread> threads = new Vector<SolveThread>(CORES);
	Scanner scan = new Scanner(System.in);
	private int curCase = 0, T = 0;
	
	public ThreadDispatcher(){
		System.out.println("Paste input for qualification round - problem C");
		T = Integer.parseInt(scan.nextLine());
		for(int i = 1; i <= CORES; i++){
			if(i <= T){
				String line = scan.nextLine();
				curCase++;
				String[] limitsStr = line.split("\\s"); 
				int A = Integer.parseInt(limitsStr[0]);
				int B = Integer.parseInt(limitsStr[1]);
				SolveThread st = new SolveThread(A, B, curCase,this);
				threads.add(st);
				st.run();
			}
		}
	}
	
	public void finish(SolveThread thread){
		System.out.println("Case #" + thread.casenb + ": " + thread.pairs);
		threads.remove(thread);
		if(curCase < T){
			String line = scan.nextLine();
			curCase++;
			String[] limitsStr = line.split("\\s"); 
			int A = Integer.parseInt(limitsStr[0]);
			int B = Integer.parseInt(limitsStr[1]);
			SolveThread st = new SolveThread(A, B, curCase,this);
			threads.add(st);
			st.run();
		}
	}
	
	public static void main(String[] args){
		ThreadDispatcher td = new ThreadDispatcher();
	}
}
