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

public class PC {

    private static int[] div = {10, 100, 1000, 10000, 100000, 1000000};

    public static void main(String[] args) throws FileNotFoundException {
        if (args.length != 1) {
            System.exit(1);
        }
        File inFile = new File(args[0]);
        Scanner sc = new Scanner(inFile);
        int T = sc.nextInt();
        try (PrintWriter out = new PrintWriter("out.txt")) {
            for (int i = 1; i <= T; i++) {
                int A = sc.nextInt(), B = sc.nextInt(), count = 0, maxPow = 0;
                for (int j = 0; j < 6; j++) {
                    if (A / div[j] == 0) {
                        maxPow = j - 1;
                        break;
                    }
                }
                int[] prevFound = new int[2000000];
                for (int j = A; j <= B; j++) {
                    int pow = 0;
                    while (true) {
                        int numFront = j / div[pow];
                        if (numFront == 0) {
                            break;
                        }
                        int numBack = j % div[pow];
                        int newNum = numBack * div[maxPow - pow] + numFront;
                        if (j < newNum && A <= newNum && newNum <= B && prevFound[newNum - 1] < j) {
                            prevFound[newNum - 1] = j;
                            count++;
                        }
                        pow++;
                    }
                }
                out.println("Case #" + i + ": " + count);
            }
        }
        System.out.println("Completed!");
    }
}