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 java.io.File;
import java.io.IOException;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;


public class Recycle {

	
	public static void main (String[] args) {
		int s, t;
		Scanner scanner;
		
		try {
			scanner = new Scanner(new File("C:\\a.in"));
			if(scanner.hasNextLine()) {
				scanner.nextLine();
			}
			int testCase = 1;
			while(scanner.hasNextLine()) {
				String line = scanner.nextLine();
				Scanner iscn = new Scanner(line);
				s = iscn.nextInt();
				t = iscn.nextInt();
				iscn.close();
				
				int counter = 0;
				for(int i=s; i<t; i++) {
					counter += calcRecs(i+"", s+"", t+"");
				}
				
				System.out.println("Case #"+testCase+": " +counter);
				testCase++;
			}
		} catch (IOException e) {
			System.err.println("could not open file");
		}
		
		
	}


	private static int calcRecs(String str, String s, String t) {
		int ret = 0;
		Map<String, String> holder = new HashMap<String, String>();
		for(int i=1; i<str.length(); i++) {
			
			String tmp = cycleBy(str, i);
			if(tmp.compareTo(str) > 0 && t.compareTo(tmp) >= 0) {
				if(!holder.containsKey(tmp)) {
					ret++;
					holder.put(tmp, null);
				}
			}
		}
		return ret;
	}


	private static boolean isRecycled(String a, String b) {
		for(int i=1; i<a.length(); i++) {
			if(cycleBy(a, i).equals(b)) {
				return true;
			}
		}
		return false;
	}
	
	public static String cycleBy(String str, int places) {
		return str.substring(places) + str.substring(0, places);
	}
	
}
