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 de.at.codejam.problem3.util;

import de.at.codejam.problem3.Problem3Case;
import de.at.codejam.util.AbstractCaseSolver;
import de.at.codejam.util.TaskStatus;

public class Problem3CaseSolver extends AbstractCaseSolver<Problem3Case> {

	@Override
	public String solveCase(TaskStatus taskStatus, Problem3Case caseToSolve) {

		StringBuilder resultBuilder = new StringBuilder(" ");

		String numberA = caseToSolve.getNumberA();
		String numberB = caseToSolve.getNumberB();

		int length = numberA.length();

		Integer numberN = Integer.parseInt(numberA);
		Integer numberM = Integer.parseInt(numberB);

		int numberRecycled = 0;

		while (numberN.intValue() < numberM.intValue()) {

			while (numberN.intValue() < numberM.intValue()) {

				for (int i = 1; i < length; i++) {

					String substringStartNumberN = numberN.toString()
							.substring(length - i);
					String substringEndNumberM = numberN.toString().substring(
							0, (length - i));

					log(LOGLEVEL_TRACE, numberN + ", " + numberM + ", "
							+ substringStartNumberN + ", "
							+ substringEndNumberM);

					if (numberM.toString().startsWith(substringStartNumberN)
							&& numberM.toString().endsWith(substringEndNumberM)) {

						log(LOGLEVEL_TRACE, "Found: " + numberN + "," + numberM);
						numberRecycled++;
						break;
					}
				}
				numberM = numberM.intValue() - 1;
			}

			numberM = Integer.parseInt(numberB);
			numberN = numberN.intValue() + 1;
		}

		resultBuilder.append(numberRecycled);
		return getDefaultResultBegin(taskStatus) + resultBuilder.toString();
	}
}
