import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;

public class Recycled {
    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            int t = Integer.parseInt(br.readLine());
            for (int i = 0; i < t; i++) {
                String[] str = br.readLine().split(" ");
                int a = Integer.parseInt(str[0]);
                int b = Integer.parseInt(str[1]);
                System.out.println("Case #" + (i + 1) + ": " + find(a, b));
            }
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    private static int find(int a, int b) {
        HashSet<Long> used = new HashSet<Long>();
        int digits = String.valueOf(a).length();
        if (digits == 1) return 0;
        for (int i = a; i <= b; i++) {
            int s = 10;
            int m = (int) Math.pow(10, digits-1);
            for (int j = 0; j < digits-1; j++) {
                int r = i % s;
                if (r < s/10) continue;
                int q = i / s;
                int rn = r * m + q;
                s *= 10; m /= 10;
                if (i != rn && rn >= a && rn <= b) {
                    long pp;
                    if (rn < i) pp = (long)rn << 30 | i;
                    else pp = (long)i << 30 | rn;
                    if (!used.contains(pp)) {
                        used.add(pp);
                    }
                }
            }
        }
        return used.size();
    }
}

import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;

/**
 * Created by IntelliJ IDEA.
 * User: Linkov Mikl
 * Date: 15.04.12
 * Time: 3:15
 * To change this template use File | Settings | File Templates.
 */
public class ProblemC {
    public static void main(String [] args) {
        Scanner scanner = new Scanner(System.in);

        int testCount = scanner.nextInt();

        for (int i = 0; i < testCount; i++) {
            int left =scanner.nextInt();
            int right = scanner.nextInt();
            int answer = 0;

            for (int value = left; value < right + 1; value++) {
                String str = String.valueOf(value);


                StringBuilder build = new StringBuilder(str);
                Set<Integer> set = new TreeSet<Integer>();
                for (int j = 1; j < str.length(); j++) {

                    build.append(build.charAt(0));
                    build.delete(0, 1);

                    if (build.charAt(0) == '0') {
                        continue;
                    }
                    int v1 = Integer.parseInt(build.toString());
                    int v2 = Integer.parseInt(str);

                    if ((v1 >= left) && (v1 <= right)) {
                        if ((v1 > v2)) {
                            if (!set.contains(v1)) {
                                answer++;
                                set.add(v1);
                            }
                        }
                    }
                }


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