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.util.HashSet;
import java.util.Set;


public class TestCase {

	private int totalDigit = -1;
	private int max;
	private int min;
	public TestCase(String s) {
		String[] results = s.split(" ");
		totalDigit = results[0].length();
		min = Integer.parseInt(results[0]);
		max = Integer.parseInt(results[1]);
	}
	
	public int solve() {
		Set<Pair> total = new HashSet<Pair>();
		for (int i = min; i <= max; i++) {
			for (int j = 1; j < totalDigit; j++) {
				Pair p = getPair(i, j);
				if (p != null) {
					//System.out.printf("Adding pair(%d, %d), %b\n", p.getFirst(), p.getSecond(), total.add(p));
					total.add(p);
				}
			}
		}
		return total.size();
		
	}

	private Pair getPair(int number, int digit) {
		String source = String.valueOf(number);
		String target;
		Pair result = null;
		String first;
		String second;
//		if (digit == 1) {
//			first = source.substring(totalDigit - digit);
//			second = source.substring(0, digit);
////			target = source.substring(0, totalDigit) + source.substring(totalDigit - digit);
//		} else if (digit == 2) {
			first = source.substring(totalDigit - digit);
			second = source.substring(0, totalDigit - digit);
//		}
		target =  first + second;
		int targetNumber = Integer.parseInt(target);
		if (targetNumber >= min && targetNumber <= max & targetNumber != number) {
			result = new Pair(number, targetNumber);
		}
		return result;
	}
}
