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

import java.io.*;
import java.util.StringTokenizer;

public class RecycledNums {

	/**
	 * @param args
	 */
	
	public RecycledNums(){
		
	}
	
	
	public static void recycledNums() throws IOException{
		BufferedReader rdr = new BufferedReader(new FileReader("C-small-attempt0.in"));
        PrintWriter pw = new PrintWriter(new FileWriter("C.out"));
        int cases = Integer.parseInt(rdr.readLine());

        for (int i = 0; i < cases; i++) {
			String line = rdr.readLine();
            StringTokenizer st = new StringTokenizer(line);
			int A = Integer.parseInt(st.nextToken());
			int B = Integer.parseInt(st.nextToken());
			int result = 0;
			
			for (int n=A; n<B; n++){
				for (int m=n+1; m<=B; m++){
					String ns = n+"";
					String ms = m+"";
					//System.out.println("n "+n+" m "+m);
					if(ns.length() == ms.length()){
						for(int j=ns.length()-1 ; j>0; j--){
							//System.out.println(ns+" "+ms.substring(j, ns.length())+" "+ms.substring(0, j));
							if(ms.equals(ns.substring(j, ms.length())+ns.substring(0, j))){
								result++;
								break;
								//System.out.println(n+" "+m);
							}
						}
					}
				}
			}
			
			
            pw.println("Case #"+(i+1)+": "+result);
        }
        

        pw.close();
        rdr.close();
	}
	
	public static void main(String[] args)throws IOException {
		// TODO Auto-generated method stub
		recycledNums();
	}

}
