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.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Set;


public class C {

	PrintWriter out;

	public void read() throws IOException {
		BufferedReader br = new BufferedReader(new FileReader("input.in"));
		out = new PrintWriter(new FileWriter("output.in"));
		int n = Integer.parseInt(br.readLine());
		int i = 0;
		String line;
		while (i < n) {
			line = br.readLine();
			solve(i + 1, line);

			i++;
		}

		out.close();
		out.flush();
	}

	private void solve(int c, String line) {
		
		int max = 0;
		Set numbers = new HashSet();
		out.print("Case #" + c + ": ");
		String[] tokens = line.split(" ");
		Integer A = Integer.parseInt(tokens[0]);
		Integer B = Integer.parseInt(tokens[1]);
		
		for (Integer i=A; i<=B; i++){
			int length = i.toString().length();
			for (int j=length -1 ; j>0; j--){
				Integer x = Integer.parseInt(C.recycledNumber(i.toString(),j));
				if ((A <= i) && (i < x) && (x <= B)){
					numbers.add(Integer.parseInt(i.toString().concat(x.toString())));
				}
			}	
		}
		max = numbers.size();
		out.print(max);
		out.println();
	}
	
	public static void main(String[] args) throws IOException {
		new C().read();
	}
	
	public static String recycledNumber(String a, int index) {
		
		int length = a.length();
		StringBuilder recycledNumber = new StringBuilder();
		for (int i=index ; i<length; i++){
			recycledNumber.append(a.charAt(i));
		}
		for (int j=0 ; j<index; j++){
			recycledNumber.append(a.charAt(j));
		}
		
		return recycledNumber.toString();
	}
}
