/*
 * 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.util.*;
import java.io.*;
import java.math.*;

public class C {

	private static String INPUT_FILE = "C-large.in"; 
	private static String OUTPUT_FILE = "c.out";
	private static Map<Integer, Integer> listLengthToPairs = new HashMap<Integer, Integer>();

	public static void main(String args[]) {

		listLengthToPairs.put(1, 0);
		listLengthToPairs.put(2, 1);
		listLengthToPairs.put(3, 3);
		listLengthToPairs.put(4, 6);
		listLengthToPairs.put(5, 10);
		listLengthToPairs.put(6, 15);
		listLengthToPairs.put(7, 21);

		Scanner input = null;
		PrintStream output = null;
		try {	
			input = new Scanner(new File(INPUT_FILE));
			output = new PrintStream(OUTPUT_FILE);
		} catch (Exception e) {
			System.out.println(e);		
		}
		
		int testCases = Integer.parseInt(input.nextLine());
		int count = 1;
		
		String curArgs;
		int lowerBound;
		int upperBound;

		while(input.hasNextLine()) {
			output.print("Case #" + count + ": ");
			String spl = input.nextLine();
			lowerBound = Integer.parseInt(spl.split(" ")[0]);
			upperBound = Integer.parseInt(spl.split(" ")[1]);
			
			int totalViablePairs = 0;
			Set<Integer> numbersSeen = new HashSet<Integer>();

			for (int i=lowerBound; i<=upperBound; i++) {
				if (!numbersSeen.contains(i)) {
					int viable = permuteNum(i, lowerBound, upperBound, numbersSeen);
					totalViablePairs += viable;
				}
				
			}
			
			if (count != testCases) {
				output.println(totalViablePairs);
			} else {
				output.print(totalViablePairs);			
			}
			count++;
		}
	
	
	
	}

	private static int permuteNum(int num, int lower, int upper, Set seen) {
		String s = num + "";
		int length = s.length();
		int viablecount = 1;
		
		// add initial to seen set
		seen.add(num);
		
		for (int i=0; i<length; i++) {
			int leastsig = num % 10;
			int restof = num / 10;
			int newnum = leastsig * (int)Math.pow(10, length-1) + restof;
			
			if (newnum >= lower && newnum <= upper && !seen.contains(newnum)) {
				//System.out.println(newnum);
				viablecount++;
			
				// add found number to seen set
				seen.add(newnum);	
				//System.out.println("just added: " + newnum);
			}
			
			num = newnum;

		}
		
		return listLengthToPairs.get(viablecount);
	}


}