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.HashSet;
import java.util.Scanner;

public class Numbers {

    public static void main(String[] args) throws IOException {
        Numbers numbers = new Numbers();
        numbers.findNumbers();
    }

    public void findNumbers() throws IOException {
        Scanner sc = new Scanner(new File("D:/testing/a.txt"));
        BufferedWriter bf = new BufferedWriter(new FileWriter("D:/testing/b.txt", false));
        HashSet<String> hs = new HashSet<String>();

        int T = sc.nextInt();
        for (int i = 1; i <= T; i++) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            hs.clear();
            
            int digits = (int) Math.log10(a);

            for (int n = a; n <= b; n++) {
                for (int j = 1; j <= digits; j++) {
                    int m = swapDigits(n, j);
                    if (n < m && m <= b) {
                        hs.add(String.valueOf(m) + String.valueOf(n));
                    }
                }
            }
            int val=hs.size();
            System.out.println("Case #" + i+": "+val);
            bf.write("Case #" + i+": "+val+ "\n");
        }
        bf.close();
    }

    public int swapDigits(int val, int d) {
        int power=(int)Math.pow(10, d);
        int x = val/power;
        int y = val % power;
        return y * (int) Math.pow(10, (int) Math.log10(x) + 1) + x;
    }
}
