/*
 * 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.Scanner;


public class Recycle {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int numLines = sc.nextInt();
		int lineCounts = 1;
		
		while (numLines > 0) {
			String A = sc.next();
			String B = sc.next();
//			System.out.println(A + " " + B);
			
			int result = findRecyclePairs(A, B);
			System.out.println("Case #" + lineCounts + ": " +result);
			numLines--;
			lineCounts++;
		}

	}

	private static int findRecyclePairs(String a, String b) {
		
		int result = 0;
		int strLength = a.length();
		int pos;
		int num1 = Integer.parseInt(a);
		int num2 = Integer.parseInt(b);
		int i;
		int j;
		String str1;
		String str2;
		String strTemp;
		String front;
		
		
		if (strLength > 1) {
			
			for (i = num1; i < num2; i++) {
				str1 = Integer.toString(i);
				for (j = i+1; j <= num2; j++) {
					str2 = Integer.toString(j);
					for (pos = 1; pos < strLength; pos++) {
						strTemp = str1.substring(pos);
						front = str1.substring(0, pos);
//						System.out.println(str2+ " " + front);
						
						strTemp = strTemp.concat(front);
//						System.out.println("Str2: "+ str2);
						
						if (!str2.startsWith("0") && !str1.startsWith("0")) {
							if (strTemp.equals(str2)) {
								result++;
							}
						}
					}
				}
			}
			
		}
		
		return result;
	}
	
	
}
