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.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.StringTokenizer;


public class RecycledNumbers {

	public static void main(String[] args) throws IOException{
		BufferedReader br = new BufferedReader(new FileReader("recycle.in"));
		PrintWriter out = new PrintWriter(new FileWriter("recycle.out"));
		int n = Integer.parseInt(br.readLine());
		StringTokenizer st;
		for(int count = 1; count <= n; count++){
			st = new StringTokenizer(br.readLine());
			int A = Integer.parseInt(st.nextToken());
			int B = Integer.parseInt(st.nextToken());
			boolean[] hasBeen = new boolean[B+1];
			int numPairs = 0;
			for(int i = A; i <= B; i++){
				if(hasBeen[i] == true) continue;
				hasBeen[i] = true;
				ArrayList<Integer> cycle = rotate(i);
				int numCycles = 1;
				for(int num: cycle){
					if(num > B || num < A) continue;
					if(hasBeen[num]) continue;
					hasBeen[num] = true;
					numCycles++;
				}
				numPairs += (numCycles*(numCycles-1))/2;
			}
			out.println("Case #" + count + ": " + numPairs);
		}
		out.close();
	}
	
	static ArrayList<Integer> rotate(int num){
		ArrayList<Integer> ans = new ArrayList<Integer>();
		int length = String.valueOf(num).length();
		for(int i = 1; i < length; i++){
			if(num%10 == 0){
				num = (int)((num%10)*Math.pow(10, length-1)) + num/10;
			} else {
				num = (int)((num%10)*Math.pow(10, length-1)) + num/10;
				ans.add(num);
			}
		}
		return ans;
	}
}
