package codejam;

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

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

import java.io.*;
import java.util.*;
public class codejam2
{

    void kick() throws IOException

    {
        FileReader fr=new FileReader("input.in");
        BufferedReader br=new BufferedReader(fr);

        FileWriter fw=new FileWriter("output.in");
        BufferedWriter bw=new BufferedWriter(fw);
        PrintWriter pw=new PrintWriter(bw);

        String txt="";
        int tc=Integer.parseInt(br.readLine());
        int c=0;
        

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

            StringTokenizer st=new StringTokenizer(txt);
            int a=Integer.parseInt(st.nextToken());
            int b=Integer.parseInt(st.nextToken());
            int posi=0;

            for(int i=a; i<b; i++)
            {
                for(int j=i+1; j<=b; j++)
                {
                    String a1=Integer.toString(i);
                    String b1=Integer.toString(j);

                    if(pos(a1,b1))
                       { posi++;}

                }
            }
            
            c++;
            pw.println("Case #"+c+": "+posi);

        }
        
        

        pw.close();
        bw.close();
        fw.close();

        br.close();
        fr.close();
    }

    boolean pos(String s,String p)
    {

        p=p+p;

        for(int j=0; j<s.length(); j++)
        {
            String subs=p.substring(j,j+(s.length()));
            if(s.equalsIgnoreCase(subs))
            {
                return true;
            }
        }
        return false;
    }
}