/*
 * 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.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.PrintWriter;
import java.util.Scanner;

class Solution {
    private final String FILE_IN = "C-small-attempt0.in";
    private final String FILE_OUT = "C-small-attempt0.out";
    
    private final Scanner mScanner;
    private final PrintWriter mOut;

    private final int[] shifts = new int[7];
    private int shiftsCount = 0;
    
    public Solution() throws FileNotFoundException {
        mScanner = new Scanner(new FileInputStream(FILE_IN));
        mOut = new PrintWriter(new FileOutputStream(FILE_OUT));
    }
    
    public void closeFiles() {
        mScanner.close();
        mOut.close();
    }
    
    private int digitsAmount(int number) {
        int r = 0;
        while (number > 0) {
            number /= 10;
            r++;
        }
        return r;
    }
    
    private static int shiftRight(int number, int d) {
        int last = number % 10;
        for (int i = 0; i < d - 1; i++) {
            last *= 10;
        }
        
        return number / 10 + last;
    }
    
    private boolean isShiftedAlready(int shifted) {
        for (int i = 0; i < shiftsCount; i++) {
            if (shifts[i] == shifted) {
                return true;
            }
        }
        return false;
    }
    
    private void solve(int caseId, int A, int B) {
        int r = 0;
        int d = digitsAmount(A);
        
        for (int i = A; i < B; i++) {
            int shifted = i;
            shiftsCount = 0;
            for (int k = 0; k < d - 1; k++) {
                shifted = shiftRight(shifted, d);
                if (i < shifted && shifted <= B && !isShiftedAlready(shifted)) {
                    r++;
                    shifts[shiftsCount] = shifted;
                    shiftsCount++;
                }
            }
        }
        mOut.println("Case #" + (caseId + 1) + ": " + r);
    }
    
    public Solution run() {
        int n = mScanner.nextInt();
        mScanner.nextLine();
        
        for (int i = 0; i < n; i++) {
            int A = mScanner.nextInt();
            int B = mScanner.nextInt();
            if (mScanner.hasNext()) {
                mScanner.nextLine();
            }
            
            solve(i, A, B);
        }
        return this;
    }
}

public class Main {
    public static void main(String[] args) throws FileNotFoundException {
        new Solution().run().closeFiles();
    }
}
