import java.util.HashSet;
import java.util.Scanner;

public class C {

	static HashSet p = new HashSet();
	static int low;
	static int high;
	int count = 0;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int no = sc.nextInt();

		for (int i = 1; i <= no; i++) {

			p.clear();
			low = sc.nextInt();
			high = sc.nextInt();

			for (int l = low; l <= high; l++) {
				recycle(l);
			}
			System.out.println("Case #" + i + ": " + p.size());

		}
	}

	public static void recycle(int no) {

		String s = Integer.toString(no);
		for (int i = 0; i < s.length(); i++) {
			String rec = s.substring(i) + s.substring(0, i);
			int r = Integer.parseInt(rec);
			if (r != no && r >= low && r <= high) {
				int min = Math.min(r, no);
				int max = Math.max(r, no);
				String a = Integer.toString(min) + "" + Integer.toString(max);
				p.add(a);

			}
		}

	}
}

import java.io.*;
import java.util.*;

class Recycled
{
    public static void main(String[] args) throws IOException
    {
        Scanner s = new Scanner(new File(args[0]));

        int numTests = s.nextInt();

        for (int i = 1; i <= numTests; i++)
        {
            // Clear the trailing newline on this line.
            s.nextLine();

            int A = s.nextInt();
            int B = s.nextInt();
            int L = (""+A).length()-1;
            int E = (int)Math.pow(10, L);

            int count = 0;
            List<Integer> seen = new ArrayList<Integer>(L);
            for (int j = A; j < B; j++)
            {
                int curr = j;
                for (int k = 0; k < L; k++)
                {
                    curr = (curr / 10) + (curr % 10) * E;
                    if (curr > j && curr <= B && !seen.contains(curr))
                    {
                        count++;
                        seen.add(curr);
                    }
                }

                seen.clear();
            }

            System.out.println("Case #" + i + ": " + count);
        }
    }
}
