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

package recycled;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.TreeSet;

/**
 *
 * @author Alfred
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
    try {
            FileInputStream fstream = new FileInputStream("C-small-attempt0.in");
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            FileWriter outFile = new FileWriter("out.txt");
            PrintWriter out = new PrintWriter(outFile);
            String line;
            line = br.readLine();
            int cases = Integer.parseInt(line);
            for (int i=1; i<=cases;i++){
                line = br.readLine();
                String[] values = line.split(" ");
                int A = Integer.parseInt(values[0]);
                int B = Integer.parseInt(values[1]);
                int total=0;
                for (int n=A; n<=B;n++){
                    TreeSet<String> solutions = new TreeSet<String>();
                    for (int k=1;k<values[1].length();k++){
                        String m = circshift(n,k);
                        int mVal = Integer.parseInt(m);
                        if(mVal<=B && mVal!=n  && mVal> n && !m.startsWith("0") && m.length()==Integer.toString(n).length() )
                        {
                            solutions.add(m);
                        }                   
                    }
                    total+=solutions.size();
                }
                out.println("Case #"+i+": "+total);
            }
            in.close();
            out.close();
        } catch (Exception e) {//Catch exception if any
            System.err.println("Error: " + e.getMessage());
        }

}

    private static String circshift(int n, int k) {
        String nString=Integer.toString(n);
        int len=nString.length();
        String m =  nString.substring(len-k)+nString.subSequence(0, len-k);
        //System.out.println(n+" "+m);
        return m;
    }

}

import java.io.*;
import java.util.*;
import java.io.*;
import java.util.*;
import static java.lang.System.*;  

import java.util.Map;
import java.util.TreeMap;
import java.util.Collection;
import java.util.List;
import java.util.Arrays;
import java.util.Iterator;
public class goog {
        
 
    public static void main(String[] args) throws IOException {
   Scanner file = new Scanner(new File("C-small-attempt0.in."));
     PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("prob1.out")));
     int times = file.nextInt();
       file.nextLine();
       
       for(int i = 0;i<times;i++) {
       ArrayList<String> answers = new ArrayList<String>();
       out.print("Case #"+(i+1)+": ");
       int a =file.nextInt();
       int b= file.nextInt();
      
       int answer =0;
       int random =0;
       for(int d = a; d<b+1;d++) {
       	for(int e =d+1;e<b+1;e++) {
       		if(e<=9||d<=9) continue;
       		else if(answers.contains("" + d + e)) {
       		    // dont know what to do, randomly adddeed
       		    random++;
       		}
       		else {
       			//set string first number
       			String g = "" + d;
       			//set string to second number
       			String h = "" + e;
       			//set temp string to second thing
       			String change = h;
       				// rotate it to see if rotation verison works
       			h = h.substring(h.length()-1) + h.substring(0,h.length()-1);
       			while(!(h.equals(change))) {
       				// if rotated isnt the same
       				if(h.equals(g)) {
       					// if rotated is the same as the one
       					answer++;
       					answers.add("" + d + e);
       						   break;
       				}
       				// rotate it again
       				h = h.substring(h.length()-1) + h.substring(0,h.length()-1);
       			}
       			
       		}
       	}
       }
       out.println(answer);
       System.out.println(answer);
       }
      out.close();
      System.exit(0);
    }
}
