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.File;
import java.io.PrintWriter;
import java.util.Scanner;

public class RecNumbers {
	
	static Scanner in;
	static PrintWriter out;
	
	
	public static boolean isRecycled(int n, int m){
		boolean recycled = false;
		String first = Integer.toString(n);
		String second = Integer.toString(m);
		int len = first.length();
		
		for(int i = 0; i < len; i++){
			if(len > 2){
				first = "" + first.charAt(len - 1) + first.substring(0,len - 1);	
			} else if (len == 2){
				first = "" + first.charAt(1) + first.charAt(0);
			} else {
				return false;
			}
			
			if(first.equals(second)){
				recycled = true;
			}
		}
		
		return recycled;
	}
	
	public static void main(String[] args) throws Exception {
		in = new Scanner(new File("C-small-attempt0.in"));
		out = new PrintWriter(new File("C-small.out"));

		//Read file
		int A;
		int B;
		int T = in.nextInt();
		//for each case do
		for (int i = 1; i <= T; i++){
			A = in.nextInt();
			B = in.nextInt();
			int count = 0;
			out.print("Case #" + i + ": ");
			for(int j = A; j <= B; j++){
				for(int k = j + 1; k <= B; k++){
					if(isRecycled(j, k) && j > 10 && k > 10){
						count++;
					}
				}
			}
			out.print(count);
			out.println();
		}

		out.close();	
	}
}