/*
 * 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;
	}

}

/**
 * 
 */
package me.adrabi.codejam;

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
import java.util.Map;
import java.util.TreeMap;

/**
 * @author Adrabi Abderrahim, z3vil
 *
 */
public class P3
{
	public static void main(String[]$) throws NumberFormatException, IOException
	{
		List<String> recycled = new ArrayList<String>();
		{
			BufferedReader reader = new BufferedReader( new InputStreamReader(new FileInputStream("p3")));
			int count = Integer.parseInt(reader.readLine());
			
			String line = null;
			while((line = reader.readLine()) != null)
			{
				recycled.add(line);
			}
		}
		
		int currentLine = 1;
		for(String line : recycled)
		{
			String numbers[] = line.split(" ");
			if(numbers.length > 1)
			{
				Map<String, Integer> tmp = new TreeMap<String, Integer>();
				
				int a = Integer.parseInt(numbers[0]), b = Integer.parseInt(numbers[1]), count = 0;
				
				for(int index = a ; index <= b; index++)
				{
					String array[] = (index+"").split("");
					
					if(isSimilare(array))
					{
						continue;
					}
					
					List<String> elements = toList(array);
					
					int steps = array.length - 2;
					while(steps >= 1)
					{
						String element = elements.get(elements.size() - 1);
						elements.remove(elements.size() - 1);
						elements.add(0, element);
						steps--;
						
						String number = toString(elements);
						if(number.startsWith("0"))
						{
							continue;
						}
						else if(number.endsWith("00"))
						{
							continue;
						}
						else
						{
							int testNumber = Integer.parseInt(number);
							if( index < testNumber && testNumber <= b )
							{
								if(tmp.containsKey(number))
								{
									tmp.put(number, tmp.get(number) + 1);
								}
								else
								{
									tmp.put(number, 1);
								}
								if(tmp.get(number) < 4)
								{
									count++;
								}
							}
						}
					}
				}
				
				System.out.printf("Case #%d: %d\n", currentLine++, count);
			}
			else
			{
				System.out.printf("Case #%d: 0\n", currentLine++);
			}
		}
		
		
	}
	
	private static boolean isSimilare(String[]array)
	{
		String lastElement = array[1];
		boolean check = true;
		for(int start = 2; start < array.length; start++)
		{
			if(!lastElement.equals(array[start]))
			{
				check = false;
				break;
			}
			lastElement = array[start];
		}
		return check;
	}
	
	private static String toString(List<String> list)
	{
		String str = "";
		for(String tmp : list)
		{
			str += tmp;
		}
		return str;
	}
	
	private static List<String> toList(String array[])
	{
		List<String> list = new ArrayList<String>();
		for(int start = 1; start < array.length; start++)
		{
			list.add(array[start]);
		}
		return list;
	}
}
