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

public class G3 {

    public static void main(String[] args) throws Exception {
        BufferedReader in = new BufferedReader(new FileReader("d:\\C-small-attempt0.in"));
        int n = Integer.parseInt(in.readLine());
        BufferedWriter out = new BufferedWriter(new FileWriter("d:\\g3o.txt"));
        int from, to;
        for (int i = 1; i <= n; i++) {
            String[] s = in.readLine().split(" ");
            from = Integer.parseInt(s[0]);
            to = Integer.parseInt(s[1]);
            int answer = solve(from, to);
            System.out.println("Case #" + i + ": " + answer);
            out.write("Case #" + i + ": " + answer);
            out.newLine();
        }
        out.close();
    }

    private static int solve(int from, int to) {
        int result = 0;
        int digits = (int) Math.floor(Math.log10(from));
        Set<String> set = new HashSet<String>();
        for (int i = from; i <= to; i++) {
            int base10 = 10;
            int baseBig10 = (int) Math.pow(10., digits);
            for (int l = 0; l < digits; l++) {
                int cycled = baseBig10 * (i % base10) + (i/base10);
                if (cycled != i && cycled>=from && cycled <= to) {
                    result++;
                    if (!set.add(String.valueOf(i)+" "+cycled))
                    System.err.println(i +" <->"+cycled);
                }
                base10 *= 10;
                baseBig10 /= 10;
            }
        }
        return set.size()/2;
    }
}
