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 org.moriraaca.codejam.recyclednumbers;

import java.util.HashSet;

import org.moriraaca.codejam.AbstractSolver;
import org.moriraaca.codejam.OutputDestination;
import org.moriraaca.codejam.SolverConfiguration;

@SolverConfiguration(parser = RecycledNumberDataParser.class, inputFileName = "ultra-large.in", outputDestination=OutputDestination.FILE)
public class RecycledNumbersSolver extends
		AbstractSolver<RecycledNumbersTestCase> {
	
	public static void main(String[] args) {
		new RecycledNumbersSolver().getSolution();
	}
	
	private int digitsNumber;
	
	private int headShift;
	
	private HashSet<Integer> usedNumbers = new HashSet<Integer>();

	@Override
	protected String solveTestCase(RecycledNumbersTestCase testCase) {
		int counter = 0;
		
		digitsNumber = String.valueOf(testCase.A).length();
		
		headShift = 1;
		
		for (int i = 0; i < digitsNumber; i++) {
			headShift *= 10;
		}
		
		for (int i = testCase.A; i <= testCase.B; i++) {
			counter += rotateNumber(i, testCase.B);
		}
		
		return String.valueOf(counter);
	}

	private int rotateNumber(int number, int B) {
		int counter = 0;
		
		int orginalNumber = number;
		
		usedNumbers.clear();
		
		for(int i = 1; i < digitsNumber; i++) {
			number += (number % 10) * headShift;
			number /= 10;
			
			if (number > orginalNumber && number < B && !usedNumbers.contains(number)) {
				counter++;
				usedNumbers.add(number);
			}
		}
		
		return counter;
	}
}
