/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package gcj;

import java.io.File;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Scanner;

/**
 *
 * @author daniele
 */
public class GCJ_C {
    
    public static void main(String[] args) throws Exception{
        
        
        
        Scanner in = new Scanner(new File(args[0]));
        FileWriter out = new FileWriter("/home/daniele/Scrivania/Output");
        

        int prove=in.nextInt();
        int min,max;
        int cifre;
        int cifreaus;
        String temp;
        int aus;
        int count=0;
        ArrayList<Integer> vals = new ArrayList<Integer>();
        int jcount=0;
        ArrayList<Integer> perm = new ArrayList<Integer>();
        
        out.write("");
        out.flush();
        
        for(int i=1;i<=prove;i++){
            
            out.append("Case #" +i+": ");out.flush();
            
            min=in.nextInt();
            max=in.nextInt();
            
            for(int j=min;j<=max;j++){
               if(!vals.contains(j)){
                    temp=""+j;
                    cifre=temp.length();
                    aus=j;
                    perm.add(j);
                    for(int k=1;k<cifre;k++){
                        aus=rotateOnce(aus);
                        temp=""+aus;
                        cifreaus=temp.length();//elusione zeri iniziali
                        if(aus>=min && aus<=max && aus!=j && cifreaus==cifre && nobody(vals,perm)){ 
                            perm.add(aus);
                            jcount ++;
                            
                        }
                        
                    }
                    while(jcount>0){count+=jcount; jcount--;}
                    vals.addAll(perm);
                    perm= new ArrayList<Integer>();
                    
                }
            }
            out.append(count+"\n");out.flush();
            count=0;
            vals= new ArrayList<Integer>();
        }
        
        
        
    }
        static public int rotateOnce(int n){
            String s=""+n;
            if(s.length()>1){
                s=s.charAt(s.length()-1) + s.substring(0,s.length()-1);
                n=Integer.parseInt(s);
            }
            return n;
        }    
        
        static public boolean nobody(ArrayList<Integer> v,ArrayList<Integer> a){;
            for(int i=0;i<a.size();i++)
                if(v.contains(a.get(i))) return false;
            return true;
        } 
    
}


import java.io.*;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Scanner;


public class RecycledNumbers {
	
	static ArrayList<Integer> perm(int j){
		ArrayList<Integer> ret = new ArrayList<Integer>();
		String num = j+"";
		int aux;
		for(int i=0; i<num.length(); i++){
			num=num.substring(1)+num.charAt(0);
			aux=Integer.parseInt(num);
			if((aux+"").length()==num.length())
				ret.add(aux);
		}
		return ret; 
	}
	public static void main(String[] args) throws IOException {
		Scanner in = new Scanner(new FileReader("C-small-attempt0.in"));
		//Scanner in = new Scanner(System.in);
		PrintWriter out = new PrintWriter(new FileWriter("solution.out"));
		
		int cas= in.nextInt();
		in.nextLine();
		for(int i=1; i<=cas; i++){
			int a, b, res=0;
			HashSet<Map<Integer, Integer>>conj= new HashSet<Map<Integer, Integer>>();
			HashMap<Integer, Integer>aux;
			a= in.nextInt();
			b= in.nextInt();
			for(int j=a; j<=b; j++){
				ArrayList<Integer> arr=perm(j);
	            for(int h=0; h<arr.size(); h++){
	            	aux= new HashMap<Integer, Integer>();
	            	aux.put(Math.min(j, arr.get(h)), Math.max(j, arr.get(h)));
	            	if(arr.get(h)!=j && arr.get(h)<=b && arr.get(h)>=a && !conj.contains(aux)){
	            		res++;
	            		conj.add(aux);
	            	}
	            }
	        }

			out.println("Case #"+i+": "+res);
		}
		out.close();
		System.exit(0);


	}

}
