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.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.util.Scanner;


public class RecycledNumbers {
	
	public static void main(String[] args) {
		RecycledNumbers rec = new RecycledNumbers();
		File file  = new File("C:\\Users\\aadi\\Desktop\\RecycledNumbers\\C-small-attempt0.in");
		
		Numbers[] numbers = new Numbers[2000001];
		for(int i =1 ;i<2000001 ;i++){
			int length = (int) (Math.log10(i)+1);
			numbers[i] = new Numbers(i, length);
			int temp = i;
			for(int j =0 ;j<length-1; j++){
				temp = numbers[i].circularPermutes(temp, length);
				if(numbers[i].isUnique(i)){
					numbers[i].arr[(numbers[i].count)]=temp;
					numbers[i].count++;
				}
			}
		}
		try{
			FileWriter fstream = new FileWriter("C:\\Users\\aadi\\Desktop\\RecycledNumbers\\out.txt");
			BufferedWriter out = new BufferedWriter(fstream);
			Scanner scanner = new Scanner(file);
			int numOfCases = Integer.parseInt(scanner.nextLine());
			for(int i = 0; i<numOfCases ;i++){
				int pairs = 0;
				String line = scanner.nextLine();
				Scanner scanner2 = new Scanner(line);
				scanner2.useDelimiter(" ");
				String s = scanner2.next();
				int length =s.length();
				int min = Integer.parseInt(s);
				int max = scanner2.nextInt();
				System.out.println("max"+max);
				for(int j = min ; j<=max ; j++){
					for(int k =0 ;k<numbers[j].count ;k++){
						if(numbers[j].arr[k]<=max && numbers[j].arr[k]>j){
							pairs++;
						}
					}
				}
				out.write("Case #"+(i+1)+": ");
				out.write(""+pairs);
				out.write(System.getProperty("line.separator"));
				System.out.println(pairs);
				System.out.println("");
			}
			out.close();
		}catch(FileNotFoundException f){
			f.getStackTrace();
		}catch(Exception e){
			e.getStackTrace();
		}
	}	
}

class Numbers{
	int num;
	int length;
	int count;
	int[] arr = new int[6];
	
	public Numbers(int number, int length){
		this.length =length;
		this.num = number;
	}
	
	public int circularPermutes(int number,int length){
		int divider = (int) Math.pow(10,length-1);
		int temp = (number%divider)*10+number/divider;
		return temp;
	}
	
	public boolean isUnique(int number){
		for(int i =0; i<count ;i++){
			if(arr[i]==number){
				return false;
			}
		}
		return true;
	}
}
