import java.util.HashSet;
import java.util.Scanner;

public class C {

	static HashSet p = new HashSet();
	static int low;
	static int high;
	int count = 0;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int no = sc.nextInt();

		for (int i = 1; i <= no; i++) {

			p.clear();
			low = sc.nextInt();
			high = sc.nextInt();

			for (int l = low; l <= high; l++) {
				recycle(l);
			}
			System.out.println("Case #" + i + ": " + p.size());

		}
	}

	public static void recycle(int no) {

		String s = Integer.toString(no);
		for (int i = 0; i < s.length(); i++) {
			String rec = s.substring(i) + s.substring(0, i);
			int r = Integer.parseInt(rec);
			if (r != no && r >= low && r <= high) {
				int min = Math.min(r, no);
				int max = Math.max(r, no);
				String a = Integer.toString(min) + "" + Integer.toString(max);
				p.add(a);

			}
		}

	}
}


/**
 * Name: Shivam99
 * email: shivthedestroyer99@gmail.com
 */

import java.io.*;

public class ProblemC
{
    public static void main(String[] args) throws IOException{
        FileReader fr=new FileReader(args[0]);
        BufferedReader br=new BufferedReader(fr);
        String str=br.readLine();
        int t=Integer.parseInt(str);
        String ss="";
        int c=1;
        while(c<=t){
            str=br.readLine();
            int pos=str.indexOf(' ');
            String f=str.substring(0,pos);
            String s=str.substring(++pos,str.length());
            int a=Integer.parseInt(f);
            int b=Integer.parseInt(s);
            int ans=0;
            ss+="Case #"+c+": ";
            
            if(a!=b && f.length()>1){
              for(int ind=a;ind<b;ind++){
                int arr[]={0,0,0,0,0,0,0,0};
                String copy=""+ind;
                int count=1;
                while(count<copy.length()){
                  String next=copy.charAt(copy.length()-1)+copy.substring(0,copy.length()-1);
                  copy=next;
                  int num=Integer.parseInt(next);
                  if(num>ind && num<=b){
                      arr[count]=num;
                      boolean chk=true;
                      for(int j=1;j<=count;j++){
                        if(arr[j-1]==num)
                            chk=false;
                      }
                      if(chk)
                         ans++;
                  }
                  count++;
                }
              }
            }
           ss+=ans+"\n";
           c++;
        }
       System.out.print(ss);
       br.close();
       fr.close();
    }
}
