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.*;
import java.util.HashSet;

public class C {
	int a, b;
	
	int countRec(int num){
		char[] digits = String.valueOf(num).toCharArray();
		int n = digits.length;
		char[] rec = new char[n];
		HashSet<Integer> set = new HashSet<Integer>();
		int cnt=0;
		
		for(int i=1; i<n; i++){
			int index = i;
			for(int j=0; j<n; j++, index++){
				if(index>=n) index%=n;				
				rec[j] = digits[index];
			}
			
			int out = Integer.parseInt(String.valueOf(rec));
			if(out > num && out <= b && !set.contains(out)){
				cnt++;
				set.add(out);
			}
		}
		
		return cnt;
	}
	
	public void run() throws IOException{
		BufferedReader bf = new BufferedReader(new FileReader("c.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("c.out"));
		
		int kases = Integer.parseInt(bf.readLine());
		for(int kase=1; kase<=kases; kase++){
			String[] in = bf.readLine().trim().split("[ ]+");
			a = Integer.parseInt(in[0]);
			b = Integer.parseInt(in[1]);
			
			long ret = 0;
			for(int i=a; i<=b; i++) ret+= countRec(i);
			
			pw.println("Case #" + kase + ": " + ret);
		}
		
		pw.close();
	}
	
	public static void main(String[] args) throws IOException {
		new C().run();
	}
}
