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

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author Joel
 */
import java.io.*;
public class RecycledNumbers
{
    public static void main(String[] args)
    {
        try
        {
            FileWriter output = new FileWriter("C:\\Users\\Joel\\Documents\\CSCI 221\\Netbeans Projects\\Google CodeJam\\src\\C-small-attempt2.out");
            BufferedWriter out = new BufferedWriter(output);
            FileReader reader = new FileReader("C:\\Users\\Joel\\Documents\\CSCI 221\\Netbeans Projects\\Google CodeJam\\src\\C-small-attempt2.in");
            BufferedReader in = new BufferedReader(reader);
            int p = Integer.parseInt(in.readLine());
            StringBuilder test;
            int count = 0;
            for (int i = 0; i < p; i++)
            {
                String nums = in.readLine();
                int m = Integer.parseInt(nums.substring((nums.indexOf(" ")) + 1));
                int n = Integer.parseInt(nums.substring(0, nums.indexOf(" ")));
                for (int j = n; j < (m+1); j++)
                {
                    test = new StringBuilder(Integer.toString(j));
                    int k;
                    do
                    {
                        char move = test.charAt(test.length() - 1);
                        test.insert(0, move);
                        test.deleteCharAt(test.length() - 1);
                        k = Integer.parseInt(test.toString());
                        if (k > j && k < (m + 1) && k != j)
                            count++;
                    }
                    while(k != j);
                }
                out.write("Case #" + (i + 1) + ": " + count + "\n");
                count = 0;
            }
            out.close();
        }
        catch (IOException e)
        {
            
        }
    }
}
