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.io.*;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class C {
    public static void main(String[] args) throws FileNotFoundException {
        Scanner scanner = new Scanner(new File("c1.in"));
        PrintStream outputStream = new PrintStream(new FileOutputStream("c.out"));
//        PrintStream outputStream = System.out;
        int n = scanner.nextInt();
//        System.out.println(n);

        for (int i = 0; i < n; i++) {
            int a = scanner.nextInt();
            int b = scanner.nextInt();
            outputStream.println("Case #" + (i+1) + ": " + ile(a, b));
        }
    }

    private static int ile(int a, int b) {
        int para = 0;
        int ilenie = 0;

        int next = a;

        while (next <= b) {
            String now = String.valueOf(next);

//            if (!uzyte.contains(now)) {
                int przed = para;
            Set<String> uzyte = new HashSet<String>();
            for (int i = 0; i < ilecyfr(next)-1; i++) {
                    now = rotuj(now);
                    int nowInt = Integer.valueOf(now);
//                    if (ilecyfr(next) != ilecyfr(nowInt)) {
//                        continue;
//                    }

                    if (nowInt >= a && nowInt <= b && nowInt != next && !uzyte.contains(now)) {
//                        if (now > next) {
//                            System.out.println("hehe " + now + " " + next);
//                        }

//                        System.out.println(next + " " + now);
                        para++;
                        uzyte.add(now);
                    }
                }
                if (przed == para) {
                    ilenie++;
//                    System.out.println(next);

                }
//            } else {
//                System.out.println(now + " used");
//            }
            next++;
        }
//        System.out.println(ilenie);
//        return b - a - ilenie;
        return para / 2;
    }

    private static String rotuj(String n) {
        String s = String.valueOf(n);
        String substring = s.substring(1);
        return substring + s.charAt(0);

//        int len = ilecyfr(n);
//        int reszta = n %10;
//        n/=10;
//        return (int) (n + (reszta * Math.pow(10, len - 1)));
    }

    private static int ilecyfr(int n) {
        int ile = 0;
        while (n > 0) {
            ile++;
            n/=10;
        }
        return ile;
    }
}
