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.BufferedInputStream;
import java.io.BufferedOutputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;


public class ProblemC {

	private void solve() {
		Scanner in = new Scanner(new BufferedInputStream(System.in));
        PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
        
        int T = in.nextInt();
        for (int i = 1; i <= T; i++) {
        	long result = 0;
        	int A = in.nextInt();
        	int B = in.nextInt();
        	int digits = digits(A);
        	int m = (int)Math.pow(10, digits-1);
        	for (int k = A; k <= B; k++) {
        		Set<Integer> used  = new HashSet<Integer>();
        		//used.add(k);
        		int kk = k;
        		for (int d = 1; d < digits; d++) {
        			int r = kk % 10;
        			kk /= 10;
        			kk += r * m;
        			if (kk > k && kk <= B && !used.contains(kk)) {
        				result++;
        				used.add(kk);
        			}
        		}
        	}
        	out.println("Case #" + i + ": " + result);
        }
        
        
        out.flush();
        out.close();
	}
	
	private int digits(int a) {
		int d = 0;
		while (a > 0) {
			d++;
			a /= 10;
		}
		return d;
	}

	public static void main(String[] args) throws IOException {
		ProblemC solver = new ProblemC();
        solver.solve();
	}
}
