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 qualify3;

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;
import java.util.Vector;

public class RecycledNumbers {
	
	public static void main (String[] args) throws FileNotFoundException {
		Scanner in = new Scanner(new File ("src//qualify3/input.in"));
		int T = in.nextInt();
		for (int i = 0; i < T; i++) {
			Integer A = in.nextInt();
			Integer B = in.nextInt();
			String strA = A.toString();
			String strB = B.toString();
			Vector <Integer> cycles = new Vector<Integer>();
			if (strA.length() != 1) {
				for (Integer j = A; j <= B; j++) {
					
						cycles.addAll(getCycledValues(j.toString(), strB));
				}
			}
			
			System.out.println("Case #" + (i  + 1) + ": " + cycles.size());
		}
	}
	
	public static Vector<Integer> getCycledValues (String str1, String str2) {
		
		Vector <Integer> cycledNumbers = new Vector<Integer>();
		String no = new String (str1);
		int size = str1.length();
		while (true) {
			String str = "";
			str = str + no.charAt(size - 1);
			
			for (int i = 0; i < size - 1; i++) {
				str = str + no.charAt(i);
			}
					
			
			if (Integer.parseInt(str) == Integer.parseInt(str1))
				break;
			
			int cyclicNumber = Integer.parseInt(str);
			
			if (cyclicNumber >= Integer.parseInt(str1) && cyclicNumber <= Integer.parseInt(str2)) {
				cycledNumbers.add(cyclicNumber);
			}
			
			no = str;
		}
		return cycledNumbers;		
	}
}
