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.File;
import java.io.FileNotFoundException;
import java.lang.Integer;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.TreeSet;

public class RecycledNumbers {
    public static void main(String[] args) throws FileNotFoundException {
        Scanner sc = new Scanner(new File("input.in"));
        //Scanner sc = new Scanner(System.in);
        int T=sc.nextInt();

        for( int i=0;i<T;i++) {
            int count =0;
            int A = sc.nextInt();
            int B = sc.nextInt();
            int n = A;
            for(n=A;n<B;n++) {
                int l = Integer.toString(n).length();
                int n2=n;
                int n5=1;
               TreeSet<Integer> L = new TreeSet<Integer>();
                for(int j=1;j<l;j++){
                    n5=n5*10;
                }
                for(int j=1;j<l;j++) {
                    int n3=n2/10;
                    int n4=n2%10;
                    n2=n5*n4+n3;
                   
                    if(n2>n && n2<=B) {
                        if(!L.contains(n2)) {
                            L.add(n2);
                            count ++;
                        }
                    }
                }
            }
            System.out.println("Case #"+(i+1)+": "+count);
        }
    }
}
