/*
 * 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;
        } 
    
}


/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package codejam;

import java.io.*;
import java.util.*;

/**
 *
 * @author jgao
 */
public class CodeJamC {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        String file = "C-small-attempt0.in";
        List<String> input;
        try {
            input = readFile(file);
        } catch(Exception e) {
            return;
        }
        
        boolean[][] mat = recycleMatrix(0,1000);
        
        for (int i=1; i<input.size(); i++) {
            System.out.print("Case #"+i+": ");
            
            String[] strs = input.get(i).split(" ");
            int A = Integer.parseInt(strs[0]);
            int B = Integer.parseInt(strs[1]);
            
            int count = 0;
            for (int n=A; n<B; n++) {
                for (int m=n+1; m<=B; m++) {
                    if (mat[n][m]) {
                        count++;
                    }
                }
            }
            
            System.out.println(count);
        }
    }
    
    public static List<String> readFile(String file) throws Exception {
        List<String> content = new ArrayList<String>();
        BufferedReader in = new BufferedReader(new FileReader(file));
        for (String line=in.readLine(); line!=null; line=in.readLine()) {
            content.add(line);
        }
        in.close();
        return content;
    }
    
    public static boolean[][] recycleMatrix(int n, int m) {
        boolean[][] res = new boolean[m-n+1][m-n+1];
        for (int i=n; i<m; i++) {
            for (int j=i+1; j<=m; j++) {
                res[i-n][j-n] = isRecycle(i,j);
            }
        }
        return res;
    }
    
    public static boolean isRecycle(int x, int y) {
        String strX = Integer.toString(x);
        String strY = Integer.toString(y);
        
        for (int i=1; i<strX.length(); i++) {
            String strXRotate = strX.substring(i)+strX.substring(0, i);
            if (strXRotate.compareTo(strY)==0)
                return true;
        }
        
        return false;
    }
}
