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 com.dagova.recycledNumbers;

import java.util.TreeSet;

public class RecycledNumbersSolver
{
	private static int solution;
	private static int aNumber;
	private static int bNumber;

	
	public static int solve(String line)
	{
		solution = 0;
		
		String[] splittedLine = line.split(" ");
		aNumber = Integer.parseInt(splittedLine[0]);
		bNumber = Integer.parseInt(splittedLine[1]);
		
		for(int number = aNumber; number < bNumber-1; number++)
		{
			solution += solveNumber(number);
		}
		return solution;
	}

	
	public static int solveNumber(int number)
	{
		//	con el treeset evita que un n de varias veces el mismo m. Antes usaba el contador recycledNumbers y por eso fallaba.
		TreeSet<Integer> ms = new TreeSet<Integer>();
//		int recycledNumbers = 0;
		String numberAsString = Integer.toString(number);
		int numberLength = numberAsString.length();
		
		for(int charIterator = 1; charIterator < numberLength; charIterator++)
		{
			if(numberAsString.charAt(charIterator) >= numberAsString.charAt(0))
			{
				int recycledNumber = generateRecycledNumber(numberAsString, charIterator);
				if(recycledNumber <= bNumber && recycledNumber > number)
				{
					ms.add(recycledNumber);
//					recycledNumbers++;
				}
			}	
		}
		
		return ms.size();
//		return recycledNumbers;
	}
	
	
	public static int generateRecycledNumber(String numberAsString, int charIterator)
	{
		String prefix = numberAsString.substring(0, charIterator);
		String sufix = numberAsString.substring(charIterator);
		
		return Integer.parseInt(sufix.concat(prefix));
	}
}
