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.IOException;

class Round1C {
	private int Case;

	public Round1C(int Case, int A, int B) {
		this.Case = Case;
		int result = this.Computer(A, B);
		this.outPut(result);
	}

	/*
	 * N±qA¨ìB
	 * §â¨C­Ó¼Æ¦rN§@±ÛÂà«áªºµ²ªG¡A
	 * §PÂ_¡A¬O§_¤j©óN¥B¤p©óµ¥©óB
	 * ¬Oresult++
	 * 
	 * */
	private int Computer(int A, int B){
		int result = 0;
		if(this.degree(A) == this.degree(B)){
			for(int N = A; N <= B; N++){
				for(int i = 1; i <= degree(N); i++){
					int r = Rotation(N, i);
//					System.out.println("\t" + r);
					if(N < r && r <= B){
						result++;
					}
				}
			}
		}
		return result;
	}
	
	private int Rotation(int temp, int order){
		int result = 0;
		String rotation = Integer.valueOf(temp).toString();
		rotation = rotation.substring(order) + rotation.substring(0, order);
		result = Integer.parseInt(rotation);
		return result;		
	}
	
	private int degree(int temp){
		for(int i = 1; ;i++){
			temp /= 10;
			if(temp == 0){
				return i;
			}			
		}
	}
	
	private void outPut(int result) {
		try {
			System.out.println("Case #" + Case + ": " + result);
			Main.bufWriter.write("Case #" + Case + ": " + result);
			Main.bufWriter.newLine();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
}
