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.FileWriter;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Scanner;
import java.util.Stack;


public class Main {

	/**
	 * @param args
	 */
	static int recyclePair(int A, int B){
		int pairCount =0;
		HashSet<Integer> hs = new HashSet<Integer>();
		for(int x=A;x<B;x++){
			hs.clear();
			List<Integer> digits = getDigits(x);
			for(int i =1;i<digits.size();i++){
				int no = 0, k=i;
				for(int j= 0;j<digits.size();j++){
					no = no*10 + digits.get(k); k = (k+1)%digits.size();
				}
				if((x<no)&&(no<=B)&&(!hs.contains(no))){
					pairCount++;
					hs.add(no);
				}
			}
		}
		
		return pairCount;
	}
	
	
	
	
	static List<Integer> getDigits(int x){
		List<Integer> list = new ArrayList<Integer>();
		Stack<Integer> st = new Stack<Integer>();
		while(x>0){
			st.push(x - ((int)(x/10))*10);
			x /= 10;
		}
		
		
		while(!st.isEmpty()){
			list.add(st.pop());
		}
		return list;
	}
	
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = null;
		BufferedWriter bw = null;
		try{
			sc = new Scanner(new File("input.txt"));
			bw = new BufferedWriter(new FileWriter("gcj3b.txt"));
			int T = sc.nextInt();
			int A, B, x;
			for(int i=0;i<T;i++){
				A = sc.nextInt();
				B = sc.nextInt();
				bw.write("Case #"+(i+1)+": "+recyclePair(A, B));bw.newLine();
			}
		}catch(Exception e){}
		finally{
			try{
				sc.close();bw.close();
			}catch(Exception e){}
		}
		/*
		recyclePair(12345, 12345);
		System.out.println();
		System.out.println(getDigits(120980));
		*/
	}

}
