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


public class Q3 {
	
	public static void main(String[] args) {
		
		Scanner s = new Scanner(Q2.class.getResourceAsStream("C-large.in"));
		
		int nTests = s.nextInt();
		
		int iTests = 1;
		while (nTests-- > 0) {
			
			int resp = 0;
			
			int m = s.nextInt();
			int n = s.nextInt();
			
			//boolean[][] criv = new boolean[n-m+1][n-m+1];
			boolean[] criv = new boolean[n-m+1];
			
			for (int i = 0; i < criv.length; i++) {
				
				
				
				int current = m + i;
				String currentString = String.valueOf(current);
				
				if (currentString.charAt(0) == '0') continue;
				
				if (criv[current - m]) continue;
				
				criv[current - m] = true;
				
				int nInterv = 0;
				for (int j = 1; j < currentString.length(); j++) {
					String invString = currentString.substring(j).concat(currentString.substring(0, j));
					Integer inv = Integer.valueOf(invString);
					
					
					if (invString.charAt(0) == '0') continue;
					if (invString.equals(currentString)) continue;
					if (inv > n || inv < m) continue;
					
					if (criv[inv - m]) continue;

					criv [inv-m] = true;
					
					nInterv ++;
					
					//System.out.println(currentString + " --- " + invString);
				}
				
				if (nInterv > 0) {
					int bbb = nInterv + 1;
					resp+= factorial(bbb) / (2 * factorial(bbb-2));
				}
				
				
				
			}
			
			
			System.out.println("Case #" + iTests + ": " + resp);
			
			iTests++;
		}
		
	}
	
	public static long factorial( int n )
    {
        if( n <= 1 )     // base case
            return 1;
        else
            return n * factorial( n - 1 );
    }

}
