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

package Happy;
import java.io.*;
import java.math.*;
import java.lang.*;
import java.util.*;
import java.util.Arrays.*;
import java.io.BufferedReader;
//import java.io.IOException;
//import java.io.InputStreamReader;
//import java.io.PrintWriter;
//import java.util.StringTokenizer;

/**
 *
 * @author ipoqi
 */
public class Happy {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        new Happy().haha();
    }

    public void haha() {
        BufferedReader in = null;
        BufferedWriter out = null;
        try{
            in = new BufferedReader(new FileReader("C-large.in"));
            out = new BufferedWriter(new FileWriter("LLL.out"));
            int T = Integer.parseInt(in.readLine());
            System.out.println("T="+T);

            //LinkedList<Integer> mm = new LinkedList<Integer>();
            //mm.add(new LinkedList<Integer>());
           //int[][] mm;
           //for(int ii=0;ii<mm.length;ii++){
           //     mm[0][ii] = 1;
           //}


            for(int i=0;i<T;i++){
                String[] line = in.readLine().split(" ");
                int A = Integer.parseInt(line[0]);
                int B = Integer.parseInt(line[1]);
                //System.out.print(" A = "+A+"\n");
                //System.out.print(" B = "+B+"\n");

                int ans = 0;

                
                for(int j=A;j<B;j++){
                    int n=j;
                    if(n>=10){
                        String N = Integer.toString(n);
                        int nlen = N.length();
                        List<Integer> oks = new ArrayList<Integer>();
                        for(int k=0;k<nlen-1;k++){
                            String M = "";
                            for(int kk=1;kk<=nlen;kk++){
                                 M = M + N.charAt((k+kk)%nlen);
                            }
                            int m = Integer.parseInt(M);
                            //System.out.print(" N = "+N+"\n");
                            //System.out.print(" M = "+M+"\n");

                            if(m>n && m<=B) {
                                boolean isNewOne = true;
                                for(int kkk=0;kkk<oks.size();kkk++){
                                    //System.out.print(" KKK = "+oks.get(kkk)+"\n");
                                    if(m==oks.get(kkk)){
                                        isNewOne = false;
                                    }
                                }
                                if(isNewOne){
                                    //System.out.print(" N = "+N+"\n");
                                    //System.out.print(" M = "+M+"\n");
                                    oks.add(m);
                                    ans++;
                                }
                            }
                        }
                    }
                }
                out.write("Case #"+(i+1)+": "+ans+"\n");
                System.out.print("Case #"+(i+1)+": "+ans+"\n");
            }
            in.close();
            out.close();
        }catch(Exception e){
            e.printStackTrace();
            try{
                in.close();
                out.close();
            }catch(Exception e1){
                e1.printStackTrace();
            }
        }
        System.out.print("YES!\n");
    }

}
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();
	}

}


