import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

class RecycledNumbers{
	
	
	
	int getcount(int small,int large){
		int count = 0;
		for(int currnum = small; currnum < large; currnum++){
			int permut = currnum;
			int no_of_digits = 0;
			while(permut > 0){
				permut = permut/10;
				no_of_digits++;
			}
			int lastDigit = currnum % 10;
			permut = currnum / 10;
			permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
			while(permut != currnum){
				
				if(permut >= currnum && permut <= large){
					
					count++;
				}
				lastDigit = permut % 10;
				permut = permut / 10;
				permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
				
			}
			
		}
		
		return count;
	}
	
	public static void main(String args[]){
		RecycledNumbers d = new RecycledNumbers();
		
		int no_of_cases = 0;
		String input = "";
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		try{
			no_of_cases = Integer.parseInt(br.readLine());
		}
		catch(Exception e){
			System.out.println("First line is not a number");
		}
		
		for(int i=1; i <= no_of_cases;i++){
			try{
				input = br.readLine();
			}
			catch(Exception e){
				System.out.println("Number of test cases different from the number mentioned in first line");
			}
			
			System.out.print("Case #" +i+": ");
			
			StringTokenizer t =  new StringTokenizer(input);
			int small=0,large=0;
			if(t.hasMoreTokens()){
				small = Integer.parseInt(t.nextToken());
			}
			if(t.hasMoreTokens()){
				large = Integer.parseInt(t.nextToken());
			}
			System.out.println(d.getcount(small,large));
			
		}
		
		
		

	}
	
	
}
import java.util.Scanner;


public class Problem3 {
	public Problem3(){
		Scanner in = new Scanner(System.in);
		int inputs = in.nextInt();
		for(int i=0; i<inputs; i++){
			int A = in.nextInt();
			int B = in.nextInt();
			int pairs = calc(A,B);
			System.out.println("Case #"+(i+1)+": "+pairs);
		}
	}
	
	public int calc(int low, int high){
		int pairs = 0;
		for(int i=low; i<=high; i++){
			for(int j=i+1; j<=high; j++){
				boolean same = true;
				String num1 = ""+i;
				String num2 = ""+j;
				if(num1.length() == num2.length()){
					for(int k=0; k<num1.length(); k++){
						if(!(num2.contains(""+num1.charAt(k)))){
							same = false;
						}
					}
					for(int k=0; k<num2.length(); k++){
						if(!(num1.contains(""+num2.charAt(k)))){
							same = false;
						}
					}
					if(same){
						same = false;
						String prev = "";
						for(int k=num1.length()-1; k>=0; k--){
							String remain = "";
							if(num2.startsWith(prev+num1.charAt(k))){
								same = true;
								prev = prev+num1.charAt(k);
							}
							for(int l=0; l<k; l++){
								remain = remain+num1.charAt(l);
							}
							if(!(num2.contains(remain))){
								same = false;
							}
						}
					}
					if(same==true){
						pairs++;
					}
				}
			}
		}
		return pairs;
	}
	
	public static void main(String[] args){
		new Problem3();
	}
}
