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

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

/**
 *
 * @author maheshgupta
 */
public class Recycled {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        try {
            HashMap hm = new HashMap();
            File file = new File("/Users/maheshgupta/Downloads/C-small-attempt0.in");
//            File file = new File("/Users/maheshgupta/Desktop/input.txt");
            BufferedReader in = new BufferedReader(new FileReader(file));
            FileWriter fw = new FileWriter("/Users/maheshgupta/Desktop/output.txt");
            String line;
            int cases = Integer.parseInt(in.readLine());

            for (int i = 0; i < cases; i++) {

                line = in.readLine();
                String[] lineArray = line.split(" ");
                int lower = Integer.parseInt(lineArray[0]);
                int upper = Integer.parseInt(lineArray[1]);
                int pair = 0;
                for (int j = lower; j <= upper; j++) {
                    String s = Integer.toString(j);

                    int length = s.length();
                    if (length == 1) {
                        continue;
                    } else {
                        for (int k = 0; k < length; k++) {
                            if (k + 1 < length) {

                                String newNumber = s.substring(k + 1, length) + s.substring(0, k + 1);
                                if (newNumber.charAt(0) != '0') {
                                    int number = Integer.parseInt(newNumber);
                                    if (number >= lower && number <= upper && number > j) {
                                        int value = hm.get(s + "#" + newNumber) != null ? (Integer) hm.get(s + "#" + newNumber) : 0;
                                        if (value != number) {
                                            hm.put(s + "#" + newNumber, number);
                                            pair++;
                                        }

                                    }
                                }




                            }

                        }
                    }
                }
                if (i < cases - 1) {
                    fw.write("Case #" + (i + 1) + ": " + pair + "\n");
                } else {
                    fw.write("Case #" + (i + 1) + ": " + pair);
                }

                hm.clear();

            }
            fw.close();
            in.close();
        } catch (IOException e) {
            System.out.println(e.toString());
        }
    }
}
