/*
 * 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.BufferedOutputStream;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
import java.util.Scanner;

public class C {

	static final char[] digit = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9' };
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		
		Scanner sc = null;
		if (args != null && args.length > 0) {
			
			try {
				sc = new Scanner(new File(args[0]));
					
				if (args.length > 1) {
					System.setOut(new PrintStream(new BufferedOutputStream(new FileOutputStream(new File(args[1])), 128)));
				}
			} catch (FileNotFoundException e) {
				
				// e.printStackTrace();
				sc = new Scanner(System.in);
			}
			
		} else {
			
			sc = new Scanner(System.in);
		}

		int T = Integer.valueOf(sc.nextLine());
		
		for (int i = 0; i < T; i++) {
			
			int A = sc.nextInt();
			int B = sc.nextInt();
			
			int answer = solve(A, B);
			System.out.printf("Case #%d: %d\n", i + 1, answer);
			
		}
		System.out.close();
	}
	
	public static int solve(int A, int B) {
		
		int answer = 0;
		int seedNum = A;
		do {
			
			answer += hasRecycled(seedNum++, A, B);
			
		} while (seedNum < B);
		return answer;
	}
	
	public static int hasRecycled(long seedNum, long A, long B) {
		
		int count = 0;
		int ptr;
		char[] old_num_chars = String.valueOf(seedNum).toCharArray();
		int length = old_num_chars.length;
		char[] moved_num_chars = new char[length];
		List<Long> newNumList = new ArrayList<Long>();
		
		for (int i = length - 1; i > 0; i--) {
			
			ptr = i;
			for (int j = 0; j < length; j++) {
				
				if (ptr == 0) {
					
					moved_num_chars[ptr] = old_num_chars[length - 1];							
				} else {			
					
					moved_num_chars[ptr] = old_num_chars[ptr - 1];					
				}
				
				if (--ptr < 0) {
					ptr += length;
				}
				
			}
			
			
			long newNum = Long.valueOf(new String(moved_num_chars));
			if ( seedNum < newNum && newNum <= B) {
				
				boolean isNew = true;
				for (Iterator<Long> it = newNumList.iterator(); it.hasNext();) {
					Long l = it.next();
					
					if (l.equals(newNum)) {
						isNew = false;
						break;
					}
				}
				if (isNew) {
					newNumList.add(newNum);					
					count++;
					
				}
			}
			old_num_chars = moved_num_chars.clone();
			
		}
		
		return count;
	}

}
