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.google.codjam.problems;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.StringTokenizer;

public class RecycledNumbers implements ProblemInterface {
    
    
    public String run(ArrayList dataCase) {
        ArrayList numbers= dataCase;
        String aString = numbers.get(0).toString().split(" ")[0];
        String bString = numbers.get(0).toString().split(" ")[1];
        HashMap map = new HashMap();
        
        int A = Integer.parseInt(aString) ;
        int B = Integer.parseInt( bString) ;
       
        int counter =0;
        int minMov=1;
        int currentM=minMov;
        int maxMov=aString.length();
        System.out.println("***************INICIO");
            while(maxMov>currentM)
            {
                for ( int i=A ; i <B+1 ; i++ )  
                {
                    if(findM(i,A,B,currentM,maxMov,map))
                    {
                        counter++;
                    }
                }currentM++;
            }
        
        System.out.println("***************FIN");
        return counter+"";
    }
    
    public boolean findM(int n,int A,int B, int movs,int max,HashMap map)
    {
        String nS=n+"";
        String finalS="";
        String tempS="";
        String endS="";
        nS=n+"";
        tempS = nS.substring(0,max-movs);
        endS =nS.substring(max-movs,max);
        finalS= endS+tempS;
        int m =Integer.parseInt(finalS);
        if((m>A-1&&m<B+1)&&n<m)
        {
            System.out.println("( "+n+" , " +m+")");
            String key = n+""+m;
            if(!map.containsKey(key))
            {
                map.put(key,null);
                return true;
            }
        }
    
        
        return false;
    }
}
