import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

import java.io.*;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class C {
    public static void main(String [] args) throws IOException {
        TreeSet<String> ts=new TreeSet<String>();
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        int c=Integer.parseInt(br.readLine().trim());
        FileWriter fichero = new FileWriter("largoa.txt");
        PrintWriter pw = new PrintWriter(fichero);
        for(int kc=0;kc<c;kc++){
            int l,h;
            StringTokenizer st=new StringTokenizer(br.readLine());
            l=Integer.parseInt(st.nextToken());
            h=Integer.parseInt(st.nextToken());
            for(int i=l;i<=h;i++){
                String a=String.valueOf(i);
                String n="";
                for(int k=1;k<a.length();k++){
                    n=a.substring(k,a.length())+ a.substring(0,k);
                    if(String.valueOf(Integer.parseInt(n)).length()==a.length() && !n.equals(a)){
                            if(Integer.parseInt(n)<=h &&Integer.parseInt(n)>=l){
                                ts.add(a+" "+n);
                                ts.add(n+" "+a);
                            }
                          }
                    }
                }
            System.out.println("Case #"+(kc+1)+": "+ts.size()/2);
            //pw.println("Case #"+(kc+1)+": "+ts.size()/2);
            ts.clear();
        }
        fichero.close();
    }
}