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 qualification.recycled.numbers;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.net.URISyntaxException;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class RecycledNumbers {

	private static String PREFIX = "C-small-attempt0";
	private static String INPUT_FILE = PREFIX + ".in";
	private static String OUTPUT_FILE = PREFIX + ".out";
	
	private static BufferedReader getInput() {
		return new BufferedReader(new InputStreamReader(RecycledNumbers.class.getResourceAsStream(INPUT_FILE)));
	}
	
	private static PrintWriter getOutput() throws URISyntaxException, FileNotFoundException {
		File inputFile = new File(RecycledNumbers.class.getResource(INPUT_FILE).toURI());
		File packageDirectory = inputFile.getParentFile();
		File outputFile = new File(packageDirectory, OUTPUT_FILE);
		return new PrintWriter(outputFile);
	}
	
	
	
	public static void main(String[] args) throws Throwable {
		BufferedReader br = getInput();
		PrintWriter pw = getOutput();
		
		int numTestCases = new Integer(br.readLine().trim());
		
		for (int testCase = 1; testCase <= numTestCases; testCase++) {
			
			String line = br.readLine();
			Scanner read = new Scanner(line);
			
			Set<RecycledPair> pairs = new HashSet<RecycledPair>();
			int a = read.nextInt();
			int b = read.nextInt();
			int digits = Integer.toString(a).length();
			int lastDigitMultiplier = 1;
			for (int i = 1; i < digits; i++) {
				lastDigitMultiplier = lastDigitMultiplier * 10;
			}
			
			for (int num = a; num <= b; num++) {
			
				int recycledNum = num;
				for (int recycles = 1; recycles < digits; recycles++) {
					
					int lastDigit = recycledNum % 10;
					recycledNum = recycledNum / 10;
					recycledNum = (lastDigit * lastDigitMultiplier) + recycledNum;
					
					if (a <= recycledNum && recycledNum <= b && num != recycledNum && num < recycledNum) {
						RecycledPair pair = new RecycledPair(num, recycledNum);
						pairs.add(pair);
					}
				}
				
			}
			
			pw.println("Case #" + testCase + ": " + pairs.size());
			
		}
		
		pw.close();
		br.close();
	}
	
	
}
