/*
 * 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.*;
public class RecycledNums
{
    static Scanner cin = new Scanner(System.in);
    
    public static void main(String[] args)
    {
        String out = "";
        System.out.println("GO");
        int repeat = cin.nextInt();
        cin.nextLine();
        int ans=0;
        for(int i = 0; i < repeat; i++) {
            int in1 = cin.nextInt();
            int in2 = cin.nextInt();
            ans = findAns(in1, in2);
            out+="Case #" + (i+1) + ": " +ans+"\n";
        }
        System.out.println(out);
    }
    
    public static int findAns(int in1, int in2)
    {
        ArrayList<Integer> found = new ArrayList<Integer>();
        int ans = 0;
        for(int i = in1; i < in2; i++) {
            for(int j = i+1; j<=in2; j++) {
                int[] recycledNums = numsFor(i);
                for(int k = 0; k < recycledNums.length; k++) {
                    if((recycledNums[k]+"").length() == (j+"").length())
                        if(recycledNums[k] == j) {
                            /*boolean foundN = false;
                            for(int a = 0 ; a < found.size(); a++) {
                                if(j == found.get(a).intValue()) {
                                    foundN = true;
                                }
                            }
                            if(!foundN) {
                                ans++;
                                found.add(new Integer(j));
                            }*/
                            ans++;
                        }
                }
            }
        }
        return ans;
    }
    
    public static int[] numsFor(int in)
    {
        String num = in+"";
        int[] ans = new int[num.length()-1];
        for(int i = 1; i < num.length(); i++) {
            ans[i-1] = Integer.parseInt(num.substring(num.length()-i,num.length()) + num.substring(0,num.length()-i));
            for(int j = 0; j < i-1; j++) {
                if(ans[i-1] == ans[j])
                    ans[i-1] = 0;
            }
        }
        return ans;
    }
}
