/*
 * Problem C. Recycled Numbers
 * 
 * Do you ever become frustrated with television because you keep seeing the
 * same things, recycled over and over again? Well I personally don't care about
 * television, but I do sometimes feel that way about numbers.
 * 
 * Let's say a pair of distinct positive integers (n, m) is recycled if you can
 * obtain m by moving some digits from the back of n to the front without
 * changing their order. For example, (12345, 34512) is a recycled pair since
 * you can obtain 34512 by moving 345 from the end of 12345 to the front. Note
 * that n and m must have the same number of digits in order to be a recycled
 * pair. Neither n nor m can have leading zeros.
 * 
 * Given integers A and B with the same number of digits and no leading zeros,
 * how many distinct recycled pairs (n, m) are there with A â¤ n < m â¤ B?
 * 
 * Input
 * 
 * The first line of the input gives the number of test cases, T. T test cases
 * follow. Each test case consists of a single line containing the integers A
 * and B.
 * 
 * Output
 * 
 * For each test case, output one line containing "Case #x: y", where x is the
 * case number (starting from 1), and y is the number of recycled pairs (n, m)
 * with A â¤ n < m â¤ B.
 * 
 * Limits
 * 
 * 1 â¤ T â¤ 50.
 * 
 * A and B have the same number of digits.

Small dataset

1 â¤ A â¤ B â¤ 1000.

Large dataset

1 â¤ A â¤ B â¤ 2000000.

Sample


Input 
 	
Output 
 
4
1 9
10 40
100 500
1111 2222
Case #1: 0
Case #2: 3
Case #3: 156
Case #4: 287
 */

package google.codejam.y2012.qualifications;

import google.codejam.commons.Utils;

import java.io.IOException;
import java.util.StringTokenizer;

/**
 * @author Marco Lackovic <marco.lackovic@gmail.com>
 * @version 1.0, Apr 14, 2012
 */
public class RecycledNumbers {

	private static final String INPUT_FILE_NAME = "C-large.in";
	private static final String OUTPUT_FILE_NAME = "C-large.out";

	public static void main(String[] args) throws IOException {
		String[] input = Utils.readFromFile(INPUT_FILE_NAME);
		String[] output = new String[input.length];
		int x = 0;
		for (String line : input) {
			StringTokenizer st = new StringTokenizer(line);
			int a = Integer.valueOf(st.nextToken());
			int b = Integer.valueOf(st.nextToken());
			System.out.println("Computing case #" + (x + 1));
			output[x++] = "Case #" + x + ": " + recycledNumbers(a, b);
		}
		Utils.writeToFile(output, OUTPUT_FILE_NAME);
	}

	private static int recycledNumbers(int a, int b) {
		int count = 0;
		for (int n = a; n < b; n++) {
			count += getNumGreaterRotations(n, b);
		}
		return count;
	}

	private static int getNumGreaterRotations(int n, int b) {
		int count = 0;
		char[] chars = Integer.toString(n).toCharArray();
		for (int i = 0; i < chars.length; i++) {
			chars = rotateRight(chars);
			if (chars[0] != '0') {
				int m = Integer.valueOf(new String(chars));
				if (n == m) {
					break;
				} else if (n < m && m <= b) {
					count++;
				}
			}
		}
		return count;
	}

	private static char[] rotateRight(char[] chars) {
		char last = chars[chars.length - 1];
		for (int i = chars.length - 2; i >= 0; i--) {
			chars[i + 1] = chars[i];
		}
		chars[0] = last;
		return chars;
	}

}

import java.io.BufferedReader;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;

import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashMap;

/** Main function is "solve" **/
public class CodeJamProblem3 {
	static HashMap<String, String> mappings = null;

	public static void main(String args[]) {
		solve();
	}

	private static void solve() {
		readFromInputAndWriteInOutput();
	}

	private static void readFromInputAndWriteInOutput() {
		try {
			File f = new File("D:\\code_html\\C-large.in");
			FileReader fileReader = new FileReader(f);
			BufferedReader buff = new BufferedReader(fileReader);
			String totalTestCases = buff.readLine();
			PrintWriter printWriter = new PrintWriter(
					"D:\\code_html\\C-large.out");
			int testCases = Integer.parseInt(totalTestCases);
			for (int i = 1; i <= testCases; i++) {

				String line = buff.readLine();
				String outputLine = "Case #" + i + ": ";
				String result = solveForThisLine(line);
				outputLine = outputLine.concat(result);
				printWriter.println(outputLine);
				//System.out.println(outputLine);
			}
			printWriter.close();
			fileReader.close();
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (Exception e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

	}
	private static String solveForThisLine(String line) {

		String lineSplit[] = line.split(" ");
		int numA = Integer.parseInt(lineSplit[0]);
		int numB = Integer.parseInt(lineSplit[1]);
		int result = 0;
		int length = lineSplit[0].length();
		int tensLength = 1;	
	//	System.out.println();
		for(int i=0;i<length-1;i++)
		{
			tensLength=tensLength*10;
		}
		for (int i = numA; i <= numB; i++) {
			int n = i;
			ArrayList<Integer > list2 = new ArrayList<Integer>();
			for (int j = 0; j <=length; j++) {
				
				int m = reverse(i, j,tensLength);
				if (numA <= n && n < m && m <= numB) {
						if(list2.contains(m))
						{
						   continue;
						}
					list2.add(m);
					result = result + 1;
				}
				
			}
		}
		return result + "";
	}

	private static int reverse(int number, int shiftBy, int tensLength) {
		int temp = 0, reversedNumber = 0;
		for (int i = 0; i <shiftBy; i++) {		
			temp = number % 10;
			number = number / 10;
			reversedNumber = temp *tensLength  + number;
			number= reversedNumber;
		}
		return reversedNumber;
	}

}
