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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.regex.Matcher;
import java.util.regex.Pattern;

/**
 * Google code jam.
 * Qualification Round 2012.
 * Problem C. Recycled Numbers
 * 
 * Usage: &lt;app&gt; &lt;input &gt;output
 * 
 * @author sombrabr@gmail.com
 *
 */
public class QualC {

	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		
		int cases = new Integer(in.readLine());
		
		for(int i=0; i<cases; ++i) {
			String line = in.readLine();
			System.out.print("Case #" + (i+1) + ": ");
			run(line);
		}
	}

	private static void run(String line) {
		String[] parts = line.split(" ");
		
		int digits = parts[0].length();
		
		int A = Integer.parseInt(parts[0]);
		int B = Integer.parseInt(parts[1]);
		
		int count = 0;
		
		for(int n=A; n<=B; ++n) { // n is the number to recycle
			String strN = Integer.toString(n);
			
			if(strN.length()!=digits)
				continue;
			
			HashSet<Integer> numbers = new HashSet<Integer>();
			
			for(int i=1; i<digits; ++i) {
				Pattern p = Pattern.compile("(\\d*)(\\d{" + i + "})");
				Matcher m = p.matcher(strN);
				
				if(!m.matches()) {
					System.err.println("BUG: " + strN + " for " + i + " digits");
					return;
				}
				
				String strNewN = m.group(2) + m.group(1);
				if(strNewN.length() != digits) {
					System.err.println("BUG: " + strN + " for " + i + " digits with " + strNewN);
					return;
				}
				
				int newN = Integer.parseInt(strNewN);
				
				if(n < newN && newN <= B && ! numbers.contains(newN)) {
					count++;
					numbers.add(newN);
				}
			}
		}
		
		System.out.println(count);
	}
}
