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 com.sun.org.apache.bcel.internal.generic.AALOAD;

import java.io.IOException;
import java.util.HashSet;
import java.util.List;
import java.util.Set;

public class RecycledNum extends JamProblem {
    public static void main(String[] args) throws IOException {
        RecycledNum p = new RecycledNum();
        p.go();
    }

    @Override
    String solveCase(JamCase jamCase) {
        RecNCase ca = (RecNCase) jamCase;
        int res = 0;
        for (int n = ca.A; n < ca.B; n++) {
            String m = "";
            //print("n "+n);
            Set<Integer> bag = new HashSet<>();
            int length = intLength(n);
            for (int t = 1; t < length; t++) {
                int pow = (int) Math.pow(10, t);
                int pow2 = (int) Math.pow(10,length-t);
                int f = (n / pow);
                int s = n - (pow * f);
                int cand = f + (pow2 * s);
                //print("m " + cand);
                if (cand < ca.A || cand > ca.B || cand <= n) {
                    continue;
                }
                if (bag.contains(cand)) {
                    continue;
                }
                if (intLength(cand) != intLength(n)) {
                    continue;
                }
                res++;
                bag.add(cand);
                //print(""+ n+ " " + cand);
            }
        }
        return "" + res;
    }

    private void print(String m) {
        System.out.println(m);
    }

    private int intLength(int n) {
        return Integer.toString(n).length();
    }

    @Override
    JamCase parseCase(List<String> file, int line) {
        RecNCase ca = new RecNCase();
        ca.lineCount = 1;
        String s = file.get(line);
        int[] ints = JamUtil.parseIntList(s, 2);
        ca.A = ints[0];
        ca.B = ints[1];
        return ca;
    }
}

class RecNCase extends JamCase {
    int A, B;
}
