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.ArrayList;
import java.util.StringTokenizer;

/*
 * To change this template, choose Tools | Templates and open the template in the editor.
 */
/**
 *
 * @author doda
 */
public class RecycledNumbers {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws FileNotFoundException, IOException {
        // TODO code application logic here
        BufferedReader R = new BufferedReader(new FileReader("C:\\Users\\doda\\Desktop\\C-large.in"));
        PrintWriter P = new PrintWriter(new FileWriter("C:\\Users\\doda\\Desktop\\large.txt"));
        
        while (R.ready()) {
            int t = Integer.parseInt(R.readLine());
            for (int i = 0; i < t; ++i) {
                StringTokenizer s = new StringTokenizer(R.readLine());
                int out = 0;
                String O = "Case #" + (i + 1) + ":";
                int n = Integer.parseInt(s.nextToken());
                int m = Integer.parseInt(s.nextToken());
                for (int j = n; j <= m; ++j) {
                    int l[] = diffOrder(j);
                    for (int k = 0; k < l.length; ++k) {
                        if (l[k] > j && l[k] <= m) {
                            ++out;
                        }
                    }
                }
                O += " " + out;
                P.println(O);
            }
        }
        P.close();
    }

    public static int[] diffOrder(int num) {
        String s = "" + num;
        ArrayList<Integer> in = new ArrayList<Integer>();
        int re[];
        for (int i = 0; i < s.length() - 1; ++i) {
            s = s.charAt(s.length() - 1) + "" + s.substring(0, s.length() - 1);
            int y = Integer.parseInt(s);
            String h = "" + y;
            if (h.length() < s.length()) {
                y = 0;
            }
            if (!in.contains(y) && y != 0) {
                in.add(y);
            }
        }
        re = new int[in.size()];
        for (int i = 0; i < in.size(); ++i) {
            re[i] = in.get(i);
        }
        return re;
    }

}