
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.*;

public class C {

    public static void main(String[] args) throws IOException {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        int T;
        T = Integer.parseInt(reader.readLine());
        for (int i = 1; i <= T; i++) {
			String[] input = reader.readLine().split(" ");
            int result = 0;
			int A=Integer.parseInt(input[0]);
			int B=Integer.parseInt(input[1]);
			if(A<10){
				result=0;
			} else if(A<100){
				for(int j=A;j<=B;j++){
					String temp1 = j+"";
					int temp = ( (Integer.parseInt(temp1.charAt(0)+"") + Integer.parseInt(temp1.charAt(1)+"")) * 11 ) - j;
					if(temp > j && temp <=B ){
						++result;
					}
				}
				
			} else if(A<1000){ 
				for(int j=A;j<=B;j++){
					String temp = j+"";
					String temp1 = Character.toString(temp.charAt(2))+Character.toString(temp.charAt(0))+Character.toString(temp.charAt(1));
					String temp2 = Character.toString(temp.charAt(1))+Character.toString(temp.charAt(2))+Character.toString(temp.charAt(0));
					int temp3 = Integer.parseInt(temp1);
					int temp4 = Integer.parseInt(temp2);
					if(j<temp3 && temp3<=B){
						++result;
					}
					if(j<temp4 && temp4<=B){
						++result;
					}
				}
			}
			if (i < T) {
            System.out.println("Case #" + i + ": " + result);
			} else {
            System.out.print("Case #" + i + ": " + result);
			}
		}
		
	}
}