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));
			
		}
		
		
		

	}
	
	
}
package taskc;

import java.util.*;

public class TaskC {

    public static void main(String[] args) {
        new TaskC().main();
    }
    
    int numOfDigits(int x) {
        int res = 0;
        while (x > 0) {
            res++;
            x /= 10;
        }
        return res;
    }
    
    int getCycle(int n, int i) {
        String s = Integer.toString(n);
        int leftlen = s.length() - i;
        String res = s.substring(leftlen) + s.substring(0, leftlen);
        return Integer.parseInt(res);
    }
    
    Set<Integer> generateCycleNumbers(int x) {
        Set<Integer> res = new HashSet<Integer>();
        int n = numOfDigits(x);
        for (int i = 1; i < n; i++) {
            int z = getCycle(x, i);
            if (numOfDigits(z) == numOfDigits(x)) {
                res.add(z);
            }
        }
        return res;
    }
    
    int f(int x, int y) {
        int res = 0;
        
        for (int i = x; i <= y; i++) {
            Set<Integer> cycles = generateCycleNumbers(i);
            for (int q: cycles) {
                if (q >= x && q <= y && q != i) {
                    //System.out.println(i +" -> " + q);                    
                    res++;
                }
            }
        }
        
        return res/2;
    }
    
    void main() {
        Scanner s = new Scanner(System.in);
        int T = s.nextInt();
        for (int i = 1; i <= T; i++) {
            int a = s.nextInt(), b = s.nextInt();
            int ans = f(a, b);
            System.out.println("Case #" + i + ": " + ans);
        }
    }
}
