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

package com.unitedcoders.examples.codejam;

import java.io.File;
import java.io.PrintStream;
import java.util.Scanner;

public class RecycledNumbers {

    public static void main(String[] args) throws Exception {

        Scanner scanner = new Scanner(new File("/Users/nh/c.in"));
        PrintStream out = new PrintStream(new File("/Users/nh/c.out"));


        int testcases = scanner.nextInt();
        scanner.nextLine();
        for (int casenr = 1; casenr <= testcases; casenr++) {

            int a = scanner.nextInt();
            int b = scanner.nextInt();

            int p = solve(a, b);

            System.out.printf("Case #%d: %d\n", casenr, p);
            out.printf("Case #%d: %d\n", casenr, p);
        }
    }

    public static int solve(int a, int b) {

        int result = 0;

        String sA = intToString(a);
        String sB = intToString(b);

        for (int i = a; i <= b; i++) {
            if (i < 10) {
                continue;
            }

            String k = intToString(i);
            for (int j = 0; j < sA.length()-1; j++) {
                k = cycle(k);

                if((stringToInt(k)>i) && (stringToInt(k)<=b)){
                    result++;
                }

            }
        }

        return result;

    }

    public static String intToString(int i) {
        StringBuffer sb = new StringBuffer();
        while (i > 0) {
            sb.append(i % 10);
            i = i / 10;
        }

        return sb.reverse().toString();
    }

    public static int stringToInt(String s) {

        return Integer.valueOf(s);
    }

    public static String cycle(String s) {
        StringBuffer sb = new StringBuffer();
        for (int i = 1; i < s.length(); i++) {
            sb.append(s.substring(i, i + 1));
        }
        sb.append(s.substring(0, 1));
        return sb.toString();

    }


}
