/*
 * 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.util.ArrayList;
import java.util.Scanner;


public class RecycleNumber {

	/**
	 * @param args
	 */
	int NoOfTestCase = 0;
	int A = 0;
	int B = 0;
	ArrayList<Integer> knownList = new ArrayList<Integer>();
	public static void main(String[] args) {
		// TODO Auto-generated method stub 
		RecycleNumber rn = new RecycleNumber();
		Scanner sc = new Scanner(System.in);
		rn.NoOfTestCase = Integer.parseInt(sc.nextLine());
		for(int i=0;i<rn.NoOfTestCase;i++)
		{
			String input = sc.nextLine();
			String[] inputArr = input.split(" ");
			rn.A = Integer.parseInt(inputArr[0]);
			rn.B = Integer.parseInt(inputArr[1]);
			System.out.println("Case #"+(i+1)+": "+rn.solve());
		}
	}
	private int solve()
	{
		int result = 0;
		Integer currInt = 0;
		Integer newInt = 0;
		Integer temp = 0;
		String resultStr = "";
		boolean firstTime = true;
		for(int i=A;i<=B;i++)
		{
			currInt = i;
			if(true)
			{
				newInt = currInt;
				resultStr = newInt.toString();
				firstTime = true;
				while((newInt.compareTo(currInt)!=0) || firstTime)
				{
					temp = newInt;
					resultStr = rotate(resultStr);
					newInt = Integer.parseInt(resultStr);
					if(A>=newInt)
					{
						while(newInt>A)
						{
							newInt = temp;
							resultStr = rotate(resultStr);
							newInt = Integer.parseInt(resultStr);
						}
					}
					if(newInt>currInt)
					{
						if(A< newInt && B >= newInt)
						{
							knownList.add(newInt);
							result++;
						}
					}
					firstTime = false;
				}
			}
		}
		return result;
	}
	private String rotate(String s){
		String[] str = s.split("");
		String last = str[str.length-1];
		for(int i=str.length-1;i>1;i--)
		{
			str[i] = str[i-1];
		}
		str[1] = last;
		String result = "";
		for(int i=1;i<str.length;i++)
			result = result+str[i];
		return result;
	}

}
