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.io.*;
import java.util.*;

public class Recycle {

	public static void main(String[] args) throws FileNotFoundException, IOException {
		Scanner sc = new Scanner(new File("input.in"));
		FileWriter fstream = new FileWriter("out.txt");
		BufferedWriter out = new BufferedWriter(fstream);

		int T = sc.nextInt(); // number of cases
		int A;
		int B;
		int counter;
		int m;
		String nStr = "";
		String mStr = "";
		String front = "";
		String back = "";
		
		for(int i = 1; i <= T; i++) { // for each test case
			A = sc.nextInt();
			B = sc.nextInt();
			counter = 0;
			
			for(int n = A; n <= B; n++) { // at most 899 loops
				nStr = Integer.toString(n);
				if(nStr.charAt(0) == '0')
					continue;
				// create m
				for(int j = 1; j < nStr.length(); j++) { // at most 3 loops
					front = nStr.substring(0, j);
					back = nStr.substring(j);
					mStr = back.concat(front);
					if(mStr.charAt(0) == '0')
						continue;
					m = Integer.parseInt(mStr);
					
					if(n >= A && n < m && m <= B)
						counter++;
				}
			}
			out.write("Case #" + i + ": " + counter);
			if(i != T)
				out.newLine();
		}
		out.close();
	}
}
