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));
	}
}

/*
ID: lovelacer
LANG: JAVA
PROG: candy
*/
import java.io.*;
import java.util.*;
public class recycle
{
    public static void main (String [] args) throws IOException
    {
        BufferedReader f = new BufferedReader(new FileReader("recycle.txt"));
        PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("recycle1.txt")));
        
        int T = Integer.parseInt(f.readLine());
        
        HashSet<String> checked;
        
        String[] nums;
        
        for(int k = 1; k <= T; k++)
        {
            nums = f.readLine().split(" ");
            int A = Integer.parseInt(nums[0]), B = Integer.parseInt(nums[1]), ans = 0;
            for(int n = A; n < B; n++)
            {
                checked = new HashSet<String>();
                String a = "" + n;
                String tmp = a.substring(1) + a.substring(0, 1);
                while(!tmp.equals(a))
                {
                    if(Integer.parseInt(tmp) <= B && Integer.parseInt(tmp) > n && !checked.contains(tmp))
                    {
                        ans++;
                        checked.add(tmp);
                    }
                    tmp = tmp.substring(1) + tmp.substring(0, 1);
                }
            }
            
            out.println("Case #" + k + ": " + ans);
        }
        
        out.close();
        System.exit(0);
    }
}