package fixjava;

public class StringUtils {

	/** Repeat the given string the requested number of times. */
	public static String repeat(String str, int numTimes) {
		StringBuilder buf = new StringBuilder(Math.max(0, str.length() * numTimes));
		for (int i = 0; i < numTimes; i++)
			buf.append(str);
		return buf.toString();
	}

	/**
	 * Pad the left hand side of a field with the given character. Always adds at least one pad character. If the length of str is
	 * greater than numPlaces-1, then the output string will be longer than numPlaces.
	 */
	public static String padLeft(String str, char padChar, int numPlaces) {
		int bufSize = Math.max(numPlaces, str.length() + 1);
		StringBuilder buf = new StringBuilder(Math.max(numPlaces, str.length() + 1));
		buf.append(padChar);
		for (int i = 1, mi = bufSize - str.length(); i < mi; i++)
			buf.append(padChar);
		buf.append(str);
		return buf.toString();
	}

	/**
	 * Pad the right hand side of a field with the given character. Always adds at least one pad character. If the length of str is
	 * greater than numPlaces-1, then the output string will be longer than numPlaces.
	 */
	public static String padRight(String str, char padChar, int numPlaces) {
		int bufSize = Math.max(numPlaces, str.length() + 1);
		StringBuilder buf = new StringBuilder(Math.max(numPlaces, str.length() + 1));
		buf.append(str);
		buf.append(padChar);
		while (buf.length() < bufSize)
			buf.append(padChar);
		return buf.toString();
	}

	/** Intern all strings in an array, skipping null elements. */
	public static String[] intern(String[] arr) {
		for (int i = 0; i < arr.length; i++)
			arr[i] = arr[i].intern();
		return arr;
	}

	/** Intern a string, ignoring null */
	public static String intern(String str) {
		return str == null ? null : str.intern();
	}

}

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.util.Scanner;

public class RecycledNumbersLarge {

	public static void main(String[] args) {

		File file = new File("/Users/NoK/Desktop/C-large.in");
		int counter = 1;

		try {
			Scanner sc = new Scanner(file);

			int numOfCases = sc.nextInt();

			sc.nextLine();

			for (int i = 0; i < numOfCases; i++) {
				int integerN = sc.nextInt();
				int integerM = sc.nextInt();
				int numOfRecPairs = 0;
				for (int m = integerN; m <= integerM; m++) {
					String stringM = Integer.toString(m);
					int[] checkerArray = new int[stringM.length()-1];
					for (int j = 0; j < checkerArray.length; j++) {
						checkerArray[j] = -1;
					}
					int index = 0;
					for (int n = 0; n < stringM.length()-1; n++) {
						char tmpChar = stringM.charAt(stringM.length()-1);
						stringM = Character.toString(tmpChar) + stringM.substring(0, stringM.length()-1);
						if (stringM.charAt(0) != '0') {
							int newIntegerM = Integer.parseInt(stringM);
							if ((newIntegerM >= integerN) && (newIntegerM <= integerM)) {
								if (newIntegerM > m) {
									int k = 0;
									boolean exists = false;
									while (k < checkerArray.length) {
										if (checkerArray[k] == newIntegerM) {
											exists = true;
										}
										k++;
									}
									if (exists == false) {
										checkerArray[index] = newIntegerM;
										index++;
										numOfRecPairs++;
									}
								}
							}
						}
					}
				}

				try { 
					FileWriter fw = new FileWriter("/Users/NoK/Desktop/C-large.out", true);
					BufferedWriter bw = new BufferedWriter(fw);
					System.out.println("Case #" + counter + ": " + numOfRecPairs);
					bw.write("Case #" + counter + ": " + numOfRecPairs);
					bw.newLine();
					bw.close();
					counter++;
				} catch (Exception e){
					System.err.println("Error: " + e.getMessage());
				}

			}

		} catch (FileNotFoundException e ) {
			e.printStackTrace();
		}

	}

}