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();
		}


	}

}

package codejam;

import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Scanner;
import java.util.logging.Level;
import java.util.logging.Logger;

/**
 *
 * @author Gedion Moyo
 */
public class recycler {

    /**
     * @param args the command line arguments
     */
    
    public static void main(String[] args) {
        try {
           solve();
        } catch (Exception ex) {
            Logger.getLogger(recycler.class.getName()).log(Level.SEVERE, null, ex);
        }
    }

    public static void solve() throws Exception {
        Scanner in = new Scanner(new FileReader("src/codejam/input.txt"));
        PrintWriter out = new PrintWriter(new FileWriter("src/codejam/output.txt"));

        int caseCount = Integer.valueOf(in.nextLine());
        for (int caseNum = 0; caseNum < caseCount; caseNum++) {
            //System.out.println("solving case " + caseNum);
            
            out.print("Case #" + (caseNum + 1) + ":");
            out.print(" ");
            int A = in.nextInt();
            int B = in.nextInt();
            out.print(permute(A,B));
            out.print("\n");
        }
        out.flush();
        out.close();
        in.close();

    }
    
    public static int permute(int A, int B){
        int count = 0;
        HashMap<String,Integer>  map = new HashMap<>();
         
        for(int n = A;n <=B;n++){
            String N[] = (n+"").split("");
            int base = (int) (Math.floor(Math.log10(n) + 1.0));
            String[] num = new String[base];

            
            for(int j=0;j<base;j++){
                num[j] = "";
                for(int i =0; i < base; i++){
                    num[j] = num[j] + N[(i+j)%base+1];
                }
                if (A<=n && n < Integer.valueOf(num[j]) && Integer.valueOf(num[j]) <= B){
                    //System.out.print(n+"\t"+ num[j] +"\n");
                    map.put(n+","+num[j], 1);
                    count++;
                }
            }
        }
            
       return map.size();
    }
}
