/*
 * 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.util.*;
import java.io.*;
import static java.lang.Math.*;

public class C {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("C-small-attempt1.in"));
		FileWriter fw = new FileWriter("C-small.out");
		/*BufferedReader in = new BufferedReader(new FileReader("C-large.in"));
		FileWriter fw = new FileWriter("C-large.out");*/
                StringTokenizer stn = new StringTokenizer(in.readLine());
                int N = new Integer(stn.nextToken());
                
                for(int i=0;i<N;i++){
                    StringTokenizer st = new StringTokenizer(in.readLine());
                    int A = new Integer(st.nextToken());
                    int B = new Integer(st.nextToken());
                    int cant = 0;
                    for(int j=A;j<B;j++){
                        Vector<Integer> all = new Vector<Integer>();
                        String num = ""+j;
                        for(int x=num.length()-2;x>=0;x--){
                            String poss = num.substring(x+1,num.length())+num.substring(0,x+1);
                            int val = Integer.parseInt(poss);
                            if (val <= B && val > j) {
                            //if (val <= B && val >= A) {
                                /*Boolean found = true;
                                char first = poss.charAt(0);
                                for(int z=1;z<poss.length();z++){
                                    if(first!=poss.charAt(z)){
                                        found = false;
                                        break;
                                    }
                                }
                                if(!found){
                                    //System.out.print(" "+val+" ");
                                    cant++;
                                }*/
                                
                                Boolean found = false;
                                for(int z=0;z<all.size();z++){
                                    int valX = all.elementAt(z);
                                    if(valX == val){
                                       found = true;
                                       break;
                                    }
                                }
                                if(!found){
                                    //System.out.print(val+"\t");
                                    //all.add(new Integer(val));
                                    all.add(new Integer(val));
                                    cant++;
                                }
                                
                                
                                
                                //System.out.print(val+"\t");
                                //cant++;
                            }
                        }
                    }
                    //System.out.println("");
                    //System.out.println(""+(cant));
                    
                    fw.write("Case #" + (i+1) + ": " + cant + "\n");
                }
                

		fw.flush();
		fw.close();
	}

}


