
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.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;


public class Recycling {

	public static void main(String[] args) {
		try{
			
			//Input
			FileInputStream fstream = new FileInputStream("input.in");
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			
			//Output
			FileWriter ostream = new FileWriter("output.out");
			BufferedWriter out = new BufferedWriter(ostream);

			String str;
			//Read header & get num cases
			str = br.readLine();
			int numCases = Integer.parseInt(str);
			
			//Read File Line By Line
			for(int i = 1;i<=numCases;i++){
			    str = br.readLine();
			    String[] splitStr = str.split(" ");
			    
			    int A = Integer.parseInt(splitStr[0]);		
			    int B = Integer.parseInt(splitStr[1]);
			    
			    int numPairs = 0;
			    
			    for(int n=A;n<B;n++){
			    	for(int m=n+1;m<=B;m++){
			    		numPairs+=compare(n,m);
			    	}
			    }

			    
				String op = "Case #"+i+": "+numPairs;
				System.out.println(op);
				out.write(op);
				
				if(i!=numCases){
					out.newLine();
				}
			}
			
			
			//Close the input stream
			in.close();
			out.close();
		}catch (Exception e){//Catch exception if any
			System.err.println("Error: " + e.getMessage());
		}
	}
	
	public static int compare(int n,int m){
		String N = String.valueOf(n);
		String M = String.valueOf(m);
		
		//If length of String is 1, not a pair
		if(N.length() ==1 || M.length() == 1){
			return 0;
		}
		//If not same length, not a pair
		if(N.length() != M.length()){
			return 0;
		}
		
		//If they are the same, not a pair
		if(n==m){
			return 0;
		}
		
		for(int i=1;i<N.length();i++){
			//Match start region of N and end region of M
			Boolean one = N.regionMatches(0, M, M.length()-i, i);
			//Match end region of N and start region of M
			Boolean two = N.regionMatches(i, M, 0, M.length()-i);
			
			if(one && two){
				return 1;
			}
		}
		
		return 0;
	}
	
}

