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 google;

import java.io.FileNotFoundException;
import java.io.IOException;
import java.util.Scanner;

public class Recycled 
{
    public static void main(String[] args) throws FileNotFoundException, IOException 
    {
        IO.changeGoogleIO('C', 0);
        
        Scanner input = new Scanner(System.in);
        
        int n = input.nextInt();
        int a, b;
        int x, digit;
        int len;
        int result0;
        String s;
        String result;
        
        for (int i = 0; i < n; ++i) 
        {
            result = "Case #" + (i + 1) + ": "; 
            
            a = input.nextInt();
            b = input.nextInt();
            
            result0 = 0;
            
            for (int j = a; j <= b; ++j) 
            {
                s = j + "";
                len = s.length();
                
                do
                {
                    s = s.charAt(len - 1) + s.substring(0, len - 1); 
                    
                    x = Integer.parseInt(s);
                            
                    if ((x > j) && (x >= a) && (x <= b))
                        ++result0;
                }
                while (x != j);
            }
            
            result += result0;
            
            System.out.println(result);
        }
    }
}
