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;

/**
 * author - coolprosu
 * Problem - C
 */

public class RecycledNumbers {
	private int T = 0;
	public static void main(String[] args) {
		RecycledNumbers solveProb = new RecycledNumbers();
		solveProb.solve();
	}
	private void solve() {
		Scanner sc = new Scanner(System.in);
		//Input no. of test cases
		T = sc.nextInt();
		//Solved strings
		String solutionArray[] = new String[T];	
		for(int i=0;i<T;i++) {
			solutionArray[i] = "Case #"+(i+1)+": ";
			int A = sc.nextInt();
			int B = sc.nextInt();
			int recyclePairCount = 0;
			for(int n=A;n<B;n++) {
				for(int m=n+1;m<=B;m++) {
					recyclePairCount+=countRecyclable(n,m);
				}
			}
			solutionArray[i] += recyclePairCount;
		}
		//Output result
		for(int i=0;i<T;i++) {
			System.out.println(solutionArray[i]);
		}			
	}
	private int countRecyclable(int a, int b) {
		String str1 = ""+a;
		String str2 = ""+b;
		if(str1.length()!=str2.length())
			return 0;
		int totalCombinations = 0;
		for(int i=1;i<str1.length();i++) {
			//String operation calculation
			if(str2.equals(str1.substring(i,str1.length())+str1.substring(0,i)))
				totalCombinations++;
			//Mathematical calculation
			/*int takenOut = a%((int)Math.pow(10,i));
			int previousPart = (int)a/(int)Math.pow(10,i);
			int multiplier = (int)Math.pow(10,(str1.length()-i));
			int finalInt = takenOut*multiplier + previousPart; 
			if(b==finalInt)
				totalCombinations++;*/
		}
		return totalCombinations;
	}
}
