
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.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;


public class Principal {
	
	public static void main (String Args[]){
		boolean numeros[]= new boolean[2000000];
		Scanner input = new Scanner(System.in);
		File saida = new File("c:/saida.txt");
		BufferedWriter bw;
		
		int A, B, T;
		String entrada;
		String a,b;
		String search;
		int tamanho_string, teste;
		int resposta=0, temp=0;
		String texto="";
		
		
		entrada=input.nextLine();
		T= Integer.parseInt(entrada);

		
		for(int i=1;i<=T;i++){
			
			
			
			a = input.next();
			b = input.next();
			
			A = Integer.parseInt(a);
			B = Integer.parseInt(b);
			for(int j=A; j<=B; j++){
				if(numeros[j]){
					continue;
				}
				
				numeros[j]=true;
				search = ""+j+j;
				tamanho_string= a.length();
				
				for (int k=0;k<tamanho_string-1;k++){
					teste = Integer.parseInt(search.substring(k+1, k+tamanho_string+1));
					if(teste >j && teste <=B && !numeros[teste]){
						numeros[teste]=true;
						temp++;
					}
					
					
				}
				for(;temp>0;temp--)
					resposta+=temp;
				temp=0;
				
			}
			
			
			texto="Case #"+i+": "+resposta+"\n";
			
			try {
				bw=new BufferedWriter(new FileWriter(saida, true));
				bw.write(texto);
				bw.newLine();
				bw.close();
			} catch (IOException e) {
				e.printStackTrace();
			}
			
			

			
			
			for(int asd=0;asd<2000000;asd++)
				numeros[asd]=false;
			temp=0;
			resposta=0;
			
		}

		
	}

}
