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.HashSet;

public class code33 {
    public static void main(String[] args) throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        FileWriter fos = new FileWriter("outfile",false);
        BufferedWriter bw = new BufferedWriter(fos);
        int T=Integer.parseInt(br.readLine()), A , B , j ,i ;
        String str[];
        for(j=1;j<=T; j++)
        {
            str=br.readLine().split(" ");
            A= Integer.parseInt(str[0]); B=  Integer.parseInt(str[1]);
            
            bw.write("Case #"+j+": "+swapncal(A, B)+"\n");
        }
        bw.close();
        
        
    }
    public static int swapncal(int A,int B)
    {
        int n=0, p ,num; 
        String xs; 
        HashSet<Integer> set = new HashSet<Integer>();
        for (int x= A; x <=(A+B); x++)
            {
                set.clear();
                xs=x+"";
                for(p=1;p< xs.length();p++)
                {
                    num=Integer.parseInt(xs.substring(p)+xs.substring(0, p));
                    if( num > x && !set.contains(num) && num >=A && num <=B)
                    {
                        set.add(num);
                        n++;
                    }
                }
                
            }
        return n;
    }
}