/*
 * 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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;


public class Numbers {
	
	public static void main(String args[])throws IOException{
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		String regex = " ";
		int T = Integer.parseInt(in.readLine());
		String str;
		String[] split;
		String[] result = new String[T+1];
		for(int x = 1; x <= T; x++){
			result[x] = "Case #" + x + ": ";
			str = in.readLine();
			split = str.split(regex);
			if(split.length < 2) {
				result[x] = result[x].concat("0");
			} else {
				result[x] = result[x].concat(Integer.toString(getNumberOfPairs(Integer.parseInt(split[0]), Integer.parseInt(split[1]))));
			}
		}
		for(int u = 1; u <= T; u++){
			System.out.println(result[u]);
		}
			
		
	}
	
	public static int getNumberOfPairs(int a, int b){
		int pairs = 0;
		for(int x = a; x < b; x++) {
			for(int y = b; y > x; y--) {
				if(isRecycledPair(x,y)){
					pairs++;
				}
			}
		}
		return pairs;
	}
	
	public static boolean isRecycledPair(int a, int b){
		boolean result = false;
		String A = Integer.toString(a);
		String B = Integer.toString(b);
		String tempA;
		if(A.length() != 1 && B.length() != 1){
			for(int x = 1; x < A.length();x++){
				tempA = A.substring(x, A.length());
				tempA = tempA.concat(A.substring(0, x));
				if(tempA.equals(B)){
					result = true;
				}
			}
		}
		return result;
		
	}

}
