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

import java.io.IOException;
import java.util.HashSet;
import java.util.LinkedList;

import utils.InputReader;

public class SolverC {
	public static void main(String[] args) throws IOException {
		LinkedList<String> input = InputReader.read("C:/Users/Danielle/Desktop/C-small-attempt0.in");
		int num = Integer.parseInt(input.removeFirst());
		int i = 1;
		for (String string : input) {
			if (i > num) {
				System.err.println(i+">"+num);
				break;
			}
			HashSet<IntegerPair> map = new HashSet<IntegerPair>();
			String[] split = string.split(" ");
			int min = Integer.parseInt(split[0]);
			int max = Integer.parseInt(split[1]);
			for (int cur = min; cur < max; cur++){
				String str = ""+cur;
				for (int k = 1; k < str.length(); k++){
					int test = Integer.parseInt(str.substring(k)+str.substring(0, k));
					if (test != cur && test >= min && test <= max) {
						map.add(new IntegerPair(test, cur));
					}
				}
			}
			System.out.println("Case #"+(i++)+": "+map.size());
		}
	}
	
	private static class IntegerPair{
		private final int i1, i2, hash;
		
		public IntegerPair(int i1, int i2) {
			this.i1 = i1;
			this.i2 = i2;
			hash = i1+i2;
		}
		
		@Override
		public int hashCode() {
			return hash;
		}
		
		@Override
		public boolean equals(Object obj) {
			if (obj == this) return true;
			if (obj instanceof IntegerPair){
				IntegerPair other = (IntegerPair) obj;
				return (other.i1 == i1 && other.i2 == i2) || (other.i2 == i1 && other.i1 == i2);
			}
			return false;
		}
	}
}
