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

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

import java.util.Scanner;


public class RecycledNumbersLarge2 {

    public void solve() {

        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt(), t = 0;
        int count = 0, recy = 0;
        while (t < T) {
            int A = sc.nextInt();
            int B = sc.nextInt();

            int n = A, m = 0;//A â¤ n < m â¤ B

            while (n < B) {
                String nn = String.valueOf(n);
                int digits = nn.length();
                int check[] = new int[digits - 1];
                int j = 1;

                while (j < digits) {
                    String mm = nn.substring(digits - j, digits) + nn.substring(0, digits - j);
                    m = Integer.parseInt(mm);

                    if (m <= B && m > n) {

                        int k = 0;
                        while (k < check.length) {
                            if (check[k] == m) {
                                break;
                            } else if (check[k] == 0) {
                                check[k] = m;
                                break;
                            }


                            ++k;
                        }
                    }
                    ++j;
                }
                count = 0;
                for (int i = 0; i < check.length; ++i) {
                    if (check[i] != 0) {
                        count++;
                    }
                }

                recy += count;


                ++n;

            }
            System.out.println("Case #" + (t + 1) + ": " + recy);
            recy = 0;


            ++t;
        }


    }

    public static void main(String[] args) {

        new RecycledNumbersLarge2().solve();
        /*
         * int n = 12345; int j = 2; String nn = String.valueOf(n); int digits =
         * nn.length(); String mm = nn.substring(digits - j, digits) +
         * nn.substring(0, digits - j);
        System.out.println(mm);
         */
    }
}
