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 ProblemC {
	static Scanner in = new Scanner(System.in);

	public static void main(String[] args) {
		int lineCount = Integer.valueOf(in.nextLine());
		int[] T = new int[lineCount];

		for(int t = 0; t < lineCount; t++) {
			int A = in.nextInt(),
				B = in.nextInt(),
				count = 0;

			for (int n = A; n <= B; n++) {
				int digits = String.valueOf(n).length() - 1;
				String m = "" + n,
					   lastAdded = "";

				for (int i = 0; i < digits; i++) {
					int mi = Integer.valueOf(m = m.charAt(digits) + m.substring(0, digits));

					if (mi <= B && mi > n && !lastAdded.contains("" + mi)) {
						lastAdded += mi + " ";
						count++;
					}
				}
			}
			T[t] = count;
		}
		
		for(int i = 1; i <= lineCount; i++) {
			System.out.println("Case #" + i + ": " + T[i-1]);
		}
	}
}
