
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.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.PrintWriter;
import java.util.Scanner;


public class Recycled {

	/**
	 * @param args
	 * @throws FileNotFoundException 
	 */
	public static void main(String[] args) throws FileNotFoundException {
		// TODO Auto-generated method stub
	    Scanner s = new Scanner(new File("C:\\Users\\Owner\\Desktop\\a-small.in"));
	    FileOutputStream fos = new FileOutputStream("C:\\Users\\Owner\\Desktop\\a-small.out");
		PrintWriter pw = new PrintWriter(fos);
		
		int testCases = s.nextInt();
		s.nextLine();
		for(int i = 0; i < testCases; ++i){
			int n = s.nextInt();
			int m = s.nextInt();
				
		    int result = 0;
			pw.print("Case #" + (i + 1) +": ");
		
			String nstr ;
			String mstr ;
			String temp;
			for(int k = m; k > n; --k){
				mstr = k + "";
				for(int p = n; p < m && p < k; p++){
					nstr = "" + p;
			        for(int q = 0; q < mstr.length(); ++q){
			        	temp = mstr.substring(0,mstr.length() - 1);
			        	mstr = mstr.charAt(mstr.length() - 1) + temp;
			        	if(mstr.equals(nstr)){
			        		result++;
			        		break;
			        	}
			        }
				}
			}
	
			
			pw.print(result);
		    if(i != testCases - 1) pw.println();
		   
	    }
	    
		pw.close();
		s.close();

	}

}
