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

import static cj.Utils.*;

public class Recycle {
    
    public static int count(int a, int b) {
	int ret = 0;
	for (int i=a; i<=b; i++) {
	    for (int j=i+1; j<=b; j++) {
		if (recycled(i, j)) ret++;
	    }
	}
	return ret;
    }
    
    public static boolean recycled(int a, int b) {
	if (a==b) return true;
	String A = a+"";
	String B = b+"";
	for (int i=0; i<(int)Math.log10(a)+1; i++) {
	    if (A.equals(B)) return true;
	    B = B.charAt(B.length()-1) + B.substring(0, B.length()-1);
	}
	return false;
     }

    public static void main(String[] args) {
	String[] lines = readLines("in/"+args[0]);
	int num = new Integer(lines[0]) + 1;
	String[] print = new String[num-1];
	for (int i=1; i<num; i++) {
	    int[] nums = toInts(lines[i]," ");
	    int max = count(nums[0], nums[1]);
	    print[i-1] = "Case #"+i+": "+max;
	}
	writeLines(print, "out/"+args[1]);
    }

}