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.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Date;
import java.util.HashMap;
import java.util.Scanner;

public class QC_Large2012 {

	public static void main(String[] args) throws Exception {
		new QC_Large2012();
	}
	
	static final String filename = "C-large";
	int testcases;
	int[] tenPowers;
	
	public QC_Large2012() throws Exception {
		FileReader ifile = new FileReader(filename+".in");
		Scanner scanner = new Scanner(ifile);
		testcases = Integer.parseInt(scanner.nextLine());
		FileWriter ofile = new FileWriter(filename+".out");
		for (int i = 1; i <= testcases; i++) {
			ofile.write("Case #"+i+": "+solve(scanner.nextInt(), scanner.nextInt())+(i != testcases ? "\n" : ""));
		}
		ofile.close();
		System.out.println("Finished");
		
		/*
		 * Benchmarking code */
		/*
		long n = new Date().getTime();
		for (int i = 0; i < 20000000; i++)
			intStringLen(i);
		System.out.println(new Date().getTime() - n);
		n = new Date().getTime();
		for (int i = 0; i < 20000000; i++)
			intLen(i);
		System.out.println(new Date().getTime() - n);
		//solve(1, 4);
		int l = 3;
		tenPowers = new int[l+1];
		initTenPowers(tenPowers);
		System.out.println(rotR(123,0,l));*/
	}

	private int solve(int A, int B) throws Exception {
		int l = intLen(A); //len A = len B (definition)
		tenPowers = new int[l+1];
		initTenPowers(tenPowers);
		int sum = 0;
		for (int n = A; n <= B-1; n++) {
			sum += recycledPairs(n, B, l);
		}
		return sum;
	}
	
	private void initTenPowers(int[] tenPowers) {
		tenPowers[0] = 1;
		for (int i = 1; i < tenPowers.length; i++)
			tenPowers[i] = tenPowers[i-1] * 10;
	}

	private int recycledPairs(int n, int B, int l) {
		int sum = 0;
		int m;
		for (int i = 0; i < l; i++) {
			m = rotR(n, i, l);
			if (m > n && m <= B)
				sum++;
		}
		return sum;
	}
	
	private int rotR(int n, int x, int l) {
		int back = n % tenPowers[x];
		int front = n / tenPowers[x];
		return front + back * tenPowers[l-x];
	}
	
	private int intLen(int n) {
		int l = 0;
		while (n > 0) {
			n /= 10;
			l++;
		}
		return l;
	}
}
