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 recyclednumbers;

import java.util.ArrayList;


public class RecycledNumbers {

    static SimpleReader reader;
    static SimpleWriter writer;
    
    static int low;
    static int high;

    public static void main(String[] args) {
        if (args.length != 1) {
            reader = new SimpleReader();
            writer = new SimpleWriter();
        } else {
            reader = new SimpleReader(args[0]);
            writer = new SimpleWriter(args[1]);
        }
        int cases = reader.readInt();
        int[] lohi;
        for (int i = 0; i < cases; i++) {
            lohi = reader.readIntArray();
            low = lohi[0];
            high = lohi[1];
            solve(i + 1);
            System.out.println("Case " + (i + 1) + " done");
        }
        writer.flush();
        System.out.println("Done");
    }
    
    private static void solve(int caseNo) {
        int ans = 0;
        int length = Integer.toString(low).length();
        for (int i = low; i <= high; i++) {
            String s = Integer.toString(i);
            ArrayList<Integer> seen = new ArrayList<>();
            for (int j = 1; j < length; j++) {
                int cycle = Integer.parseInt(s.substring(j, length) + 
                                             s.substring(0, j));
                if (!seen.contains(cycle) && cycle <= high && cycle > i) {
                    ans++;
                    //System.out.println(Integer.toString(i) + " " + Integer.toString(cycle));
                }
                seen.add(cycle);
            }
        }
        writer.writeLine("Case #" + caseNo + ": " + ans);
    }
    
    private static boolean isRecycled(int n, int m) {
        String ns = Integer.toString(n);
        String ms = Integer.toString(m);
        if (ns.length() != ms.length()) {
            return false;
        }
        for (int i = 1; i < ns.length(); i++) {
            if (ns.equals(ms.substring(i, ms.length()) + ms.substring(0, i))) {
                return true;
            }
        }
        return false;
    }
}
