import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.Set;


public class GoogleC {
	public String szamol(String input){
		String result="";
		String a=input;
		Integer min=Integer.parseInt(a.substring(0,a.indexOf(' ')));
		a=a.substring(a.indexOf(' ')+1);
		Integer max=Integer.parseInt(a);
		Long count=0l;
		for(Integer i=min; i<=max; i++){
			String e1=i.toString();
			Set<Integer> db=new HashSet<Integer>(); 
			for (int j=1; j<e1.length();j++){
				
				String e2=e1.substring(j)+e1.substring(0,j);
				Integer k=Integer.parseInt(e2);
				if (k>i && k<=max){
					db.add(k);
					//System.out.println(e1+"\t"+e2);
				}
				
			}
			count+=db.size();
		}
		
		return count.toString();
	}
	public static void main(String[] args) {
		GoogleC a=new GoogleC();
		//String filename="input.txt";
		//String filename="C-small-attempt0.in";
		String filename="C-large.in";
		String thisLine;
		try {
			BufferedReader br = new BufferedReader(new FileReader(filename));
			BufferedWriter bw= new BufferedWriter(new FileWriter(filename+".out"));
			thisLine=br.readLine();
			Integer tnum=Integer.parseInt(thisLine);
		     for(int i=0;i<tnum;i++) { // while loop begins here
		    	 	thisLine=br.readLine();
		           System.out.println(thisLine);
		           System.out.println("Case #"+(i+1)+": "+a.szamol(thisLine)+"\n");
		           bw.write("Case #"+(i+1)+": "+a.szamol(thisLine)+"\n");
		         } // end while 
		        // end try
		     br.close();
		     bw.close();
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}


	}

}

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.util.HashSet;
import java.util.Set;

/**
 * 
 */

/**
 * @author Kamlesh Saran Dev
 * 
 */
public class RecycledPair {

	long a;
	long b;

	/**
	 * @param i
	 * @param j
	 */
	public RecycledPair(long a, long b) {
		this.a = a;
		this.b = b;
	}

	/**
	 * @return
	 */
	public long getNumberOfPairs() {
		long count = 0;
		for (long n = a; n < b; n++) {
			Set<Long> allCombinations = giveAllCombinations(n, b);
			count = count + allCombinations.size();
		}
		return count;
	}

	/**
	 * @param n
	 * @return
	 */
	private Set<Long> giveAllCombinations(long n, long b) {
		Set<Long> result = new HashSet<Long>();
		String nStr = Long.toString(n);
		for (int i = 1; i < nStr.length(); i++) {
			String backPart = nStr.substring(i);
			String frontPart = nStr.substring(0, i);
			long newNumber = Long.valueOf((backPart + frontPart));

			if (n < newNumber && newNumber <= b) {
				result.add(newNumber);
			}
		}
		return result;
	}

	public static void main(String args[]) throws Exception {
		BufferedReader bufferedReader = new BufferedReader(
				new FileReader(
						new File(
								"C:\\Documents and Settings\\Kamlesh\\Desktop\\codejam\\C-large.in")));
		int numberOfTest = Integer.valueOf(bufferedReader.readLine());
		for (int i = 1; i <= numberOfTest; i++) {
			String line = bufferedReader.readLine();
			String limits[] = line.split("\\ ");
			RecycledPair rp = new RecycledPair(Integer.valueOf(limits[0]), Integer.valueOf(limits[1]));
			System.out.println("Case #" + i + ": " +  rp.getNumberOfPairs());

		}
	}

}
