import java.io.*;

class code1
{
	public static void main(String args[]) throws Exception 
	{
		File ii = new File ("C-small-attempt1.in");
		FileInputStream fis = new FileInputStream(ii);
		BufferedReader  br = new BufferedReader(new InputStreamReader (fis));
		int cases = Integer.parseInt(br.readLine());
		FileOutputStream fout = new FileOutputStream ("output.txt");
		DataOutputStream dout = new DataOutputStream (fout);
		int total=0;
		for(int i=0;i<cases;i++){
		String temp = br.readLine();
		String parts [] = temp.split(" ");
		int lower = Integer.parseInt(parts[0]);
		int upper = Integer.parseInt(parts[1]);
		System.out.println(lower+" "+upper);
		
		for(int j=lower;j<=upper;j++)
		{
			int abc = j;int length=0;
			if(j<10)continue;
			while (abc!=0){abc/=10;length++;}
			abc=j;
			for(int m=0;m<length-1;m++){
				int shift = abc%10;
				abc=abc/10;
				System.out.println("hi "+j);
				abc=abc+shift*power(10,length-1);
				if(abc<=upper&&shift!=0&&abc>j)total++;
				System.out.println(total);
			}
		}
 		dout.writeBytes("Case #"+(i+1)+ ": "+total+"\n");
 		total=0;
		}//for close
		
	}

	private static int power(int i, int j) {
		int no=1;
		for(int a=0;a<j;a++){no=10*no;}
		return no;
	}
}
/**
 * Google CodeJam 2012
 * Qualification round - Problem C
 * Recycled Numbers
 * 
 * Solved by Üllar Soon <positivew@gmail.com>
 */
package eu.positivew.codejam.recycled;

import java.io.File;
import java.util.ArrayList;

import eu.positivew.codejam.framework.CodeJamIO;


/**
 * Recycled Numbers main class.
 * 
 * @author Üllar Soon <positivew@gmail.com>
 */
public class RecycledNumbersMain {

	/**
	 * Main controller for RecycledNumbers.
	 * 
	 * @param args 		Command line arguments
	 */
	public static void main(String[] args) {
		// Parse command line arguments
		String inUrl = "input.txt";
		String outUrl = "output.txt";
		if(args.length >= 1)
			inUrl = args[0];
		if(args.length >= 2)
			outUrl = args[1];
		
		
		File inFile = new File(inUrl);
		File outFile = new File(outUrl);
		
		CodeJamIO cio = new CodeJamIO();
		
		cio.inputOpen(inFile);
		cio.outputOpen(outFile);
		
		if(cio.getTestCases() > 0) {
			RecycledNumbersCase inCase;
			int i = 0;
			while(i < cio.getTestCases() && (inCase = (RecycledNumbersCase)cio.inputReadCase(new RecycledNumbersParser())) != null) {
				cio.outputWriteCase("" + countRecycledNumbers(inCase.getA(), inCase.getB()));
				i++;
			}
		}
		
		cio.inputClose();
		cio.outputClose();
	}
	
	/**
	 * Counts the distinct occurring pairs of recycled numbers between A and B (inclusive).
	 * 
	 * @param A		left limiter
	 * @param B		right limiter
	 * @return		number of distinct recycled numbers between A and B
	 */
	private static int countRecycledNumbers(int A, int B) {
		int count = 0;
		ArrayList<IntPair> foundPairs = new ArrayList<IntPair>();
		
		for(int i = A; i <= B; i++) {
			String nStr = "" + i;
			
			for(int j = 1; j < nStr.length(); j++) {
				String mStr = nStr.substring(j) + nStr.substring(0, j);
				
				if(mStr.charAt(0) == '0')
					continue;
				
				try {
					int n = Integer.parseInt(nStr);
					int m = Integer.parseInt(mStr);
					
					if(A <= n && n < m && m <= B) {
						if(!foundPairs.contains(new IntPair(n, m))) {
							foundPairs.add(new IntPair(n, m));
							count++;
						}
					}
				}
				catch(NumberFormatException ex) {
					System.err.println("Number conversion error!");
				}
			}
		}
		
		return count;
	}

}
