/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package recyclednumbers;

import java.util.HashSet;

/**
 *
 * @author vandit
 */
public class RecycleNumbers {

    private HashSet<String> numbers = new HashSet<String>();
    private HashSet<String> initialTempNumbers = new HashSet<String>();
    private HashSet<String> finalTempNumbers = new HashSet<String>();

    HashSet<Pair> numberPairs = new HashSet<Pair>();


    private void findRecycledNumbers(int start, int end, int places) {


        for (int i = start; i <= end; i++) {
            String initialNumber = Integer.toString(i);
            //if (!(numbers.contains(initialNumber) || finalTempNumbers.contains(initialNumber))) {

                StringBuffer tempNumber = new StringBuffer(initialNumber);
                int len = tempNumber.length();
                int startIndexToMove = len - places;
                String tempString = tempNumber.substring(startIndexToMove);
                if ((places == 1 && tempString.equals("0")) || tempString.charAt(0) == '0') {
                    continue;
                }
                tempNumber.delete(startIndexToMove, len);
                String finalTempNumber = tempString + tempNumber.toString();

                if (! (finalTempNumber.equals(initialNumber) || Integer.parseInt(finalTempNumber) > end || Integer.parseInt(finalTempNumber) < Integer.parseInt(initialNumber))) {
                    numbers.add(initialNumber);
                    finalTempNumbers.add(finalTempNumber);
                    Pair pair = new Pair(finalTempNumber,initialNumber);
                    numberPairs.add(pair);
                }
            }

        

    }

    public HashSet<Pair> findAllRecycledNumbers(int start, int end) {
        int length = Integer.toString(start).length();
        for (int i = 1; i < length; i++) {
            findRecycledNumbers(start, end, i);
        }
        return numberPairs;
    }
}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.util.LinkedList;
import java.util.Map;
import java.util.StringTokenizer;


public class RecycleNum{
	private Map<String, String> map = new HashMap<String, String>();

	public static void main(String[] args) throws IOException {
	//	new Thread(new Solution()).start();
		RecycleNum sol = new RecycleNum();
		sol.start();
	}

	public RecycleNum() {
	}

	public void start() throws IOException {
		BufferedReader br = new BufferedReader(new FileReader("C-small-attempt0.in"));
		BufferedWriter wStream=new BufferedWriter( new FileWriter("C-small_attempt0.out"));
		String input;
		StringTokenizer st=null;
		int T=0;
		if((input=br.readLine()) != null) {
			st=new StringTokenizer(input);
			T=Integer.parseInt(st.nextToken());
		}
		for(int i=0;i<T;i++)
		 {
			if((input=br.readLine()) != null) {
				st=new StringTokenizer(input);
				int A = Integer.parseInt(st.nextToken());
				int B = Integer.parseInt(st.nextToken());
				int recyclePair =0;
				for(int n=A;n<B;n++){
					for(int m=n+1;m<=B;m++){
						recyclePair += checkRecyclePair(n,m);
					}
				}
				
				System.out.println(recyclePair);
				wStream.write("Case #"+(i+1)+": "+recyclePair);
				wStream.newLine();
			//	out.print("Case #"+(testNumber+1)+": "+solve(mainList,oList,bList));
				}
			System.out.println("_________________");
			
		 }
		wStream.close();
	}
	
	public int checkRecyclePair(int n, int m){
		String nStr = Integer.toString(n);
		String mStr = Integer.toString(m);
		//System.out.println(nStr+"_"+mStr);
		String temp;
		if(nStr.length() == mStr.length()){
			for(int i=0;i<mStr.length();i++){
				if(mStr.charAt(i) == nStr.charAt(0)){
					temp = mStr.substring(i)+ mStr.substring(0, i);
					if(nStr.compareTo(temp) == 0){
					//	System.out.println(nStr+"_"+temp);
						return 1;
					}
				}
			}
			return 0;
		}
		else return 0;
	}
	
}