import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

package quiz2012.quiz3;

import java.util.HashSet;
import java.util.Set;

import domain.QuizSolver;
import domain.QuizTestCaseInput;
import domain.QuizTestCaseOutput;

public class Quiz3Solver implements QuizSolver {
	@Override
	public QuizTestCaseOutput solve(QuizTestCaseInput testCaseInput) {
		Quiz3TestCaseInput input = (Quiz3TestCaseInput) testCaseInput;

		int numberOfRecycledPairs = 0;

		int n = input.getN();
		String nAsString = String.valueOf(n);
		int numberOfDigitsOfN = nAsString.length();
		int m = input.getM();

		// TODO: Remove if the following case can be generalized.
		if (numberOfDigitsOfN == 1) {
			return new Quiz3TestCaseOutput(numberOfRecycledPairs);
		}

		for (int i = n; i < m; i++) {
			Set<Integer> recycledValueSet = new HashSet<Integer>();
			for (int j = 1; j < numberOfDigitsOfN; j++) {
				int recycledValue = shiftDigitsLeft(i, j);
				if (recycledValue > i && recycledValue <= m) {
					recycledValueSet.add(recycledValue);
					System.out.println(i + ", " + recycledValue);
				}
			}

			numberOfRecycledPairs += recycledValueSet.size();
		}
		return new Quiz3TestCaseOutput(numberOfRecycledPairs);
	}

	public int shiftDigitsLeft(int n, int numberOfShifts) {
		String nAsString = String.valueOf(n);
		StringBuffer sb = new StringBuffer();
		int numberOfDigitsOfN = nAsString.length();
		for (int i = 0; i < numberOfDigitsOfN; i++) {
			sb.append(nAsString.charAt((numberOfDigitsOfN + i - numberOfShifts)
					% numberOfDigitsOfN));
		}
		return Integer.valueOf(sb.toString());
	}
}
