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

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

/**
 *
 * @author Himeshi
 */
public class RecycledNumbers {

    public static void main(String[] args) {

        int A, B, N, pairs;
        String strLine, integers;

        try {

            BufferedReader br = new BufferedReader(new InputStreamReader(new DataInputStream(new FileInputStream("D:/Academic Work/Semester 5/Code Jam/C-small.in"))));

            while ((strLine = br.readLine()) != null) {

                N = Integer.parseInt(strLine);

                for (int i = 0; i < N; i++) {
                    integers = br.readLine();
                    String[] tokens = integers.split(" ");
                    A = Integer.parseInt(tokens[0]);
                    B = Integer.parseInt(tokens[1]);
                    pairs = calculate(A, B, i);
                    writeToFile(pairs, i);
                }

            }


        } catch (Exception e) {
            System.out.println("here is the exception"+e);
        }

    }

    private static int calculate(int A, int B, int i) {
        int pairs = 0;

        for (int index = A; index <= B; index++) {
            ArrayList<Integer> list = getPairs(index);

            for (int j = 0; j < list.size(); j++) {
                if (list.get(j) <= B && list.get(j)>index) {
                   //System.out.println(""+index+" "+list.get(j));
                    pairs++;
                }
            }
        }

        return pairs;
    }

    private static ArrayList<Integer> getPairs(int index) {

        ArrayList<Integer> list = new ArrayList<Integer>();
        String temp = Integer.toString(index);
        int length = temp.length();

        char[] buffer = temp.toCharArray();

        if (index < 10) {
            return list;
        } else {


            for (int numbers = 1; numbers < length; numbers++) {
              
                char c=buffer[length-1];
                
                for(int k=buffer.length-1;k>0;k--)
                {
                    buffer[k]=buffer[k-1];                    
                }
                
                buffer[0]=c;
                String s=new String(buffer);
                int number=Integer.parseInt(s);
                
                if(!list.contains(number))
                    list.add(number);
            }
            return list;
        }
    }
    
     private static void writeToFile(int a,int N) {
        try {
            // Create file 
            FileWriter fstream = new FileWriter(new File("D:/Academic Work/Semester 5/Code Jam/out.txt"),true);
            BufferedWriter out = new BufferedWriter(fstream);
           String str="Case #"+(N+1)+": "+a+"\r\n";
           out.append(str);
            //Close the output stream
            out.close();
        } catch (Exception e) {//Catch exception if any
            System.err.println("Error: " + e.getMessage());
        }
    }
}
