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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashSet;
import java.util.Set;

public class RecycledNumbers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		try {
			BufferedReader reader = new BufferedReader(new FileReader("D:\\workspace\\GoogleCodeJam\\data\\C-large.in"));
			String line;
			BufferedWriter writer = new BufferedWriter(new FileWriter("D:\\workspace\\GoogleCodeJam\\data\\C-large.out"));
			
			line=reader.readLine();
			int c = Integer.parseInt(line);
			int i = 1;
			while ((line=reader.readLine()) != null) 
			{
				String[] ints = line.split(" ");
				int a,b;
				a = Integer.parseInt(ints[0]);
				b = Integer.parseInt(ints[1]);
				int cnt = countNumber(a,b);
				writer.write(String.format("Case #%s: %s", i, cnt));
				System.out.println(String.format("Case #%s: %s", i, cnt));
				if (i<c)
					writer.newLine();
				i++;
			} 
			writer.close();
		} catch (Exception e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
	public static int countNumber(int a, int b)
	{
		int cnt = 0;
		for (int i=a;i<b;i++)
		{
			String is = String.valueOf(i);
			Set<String> dup = new HashSet<String>();
			for (int j = 1; j < is.length(); j++)
			{
				String s = is.substring(j) + is.substring(0,j);
				if (dup.contains(s))
					continue;
				else
					dup.add(s);
				if (Integer.parseInt(s)>i && Integer.parseInt(s)<=b)
				{
					cnt++;
				}
			}
		}
		
		return cnt;
	}
}
