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.
 */

/*
 * Recycling (Numbers)
 * Jason Bradley Nel
 * 16287398
 */
import java.util.*;

public class Recycling {
    
    public static void main(String[] args) {
        
        In input = new In("input.txt");

        int T = input.readInt();

        for (int t = 0; t < T; t++){
            int min = input.readInt();
            int max = input.readInt();
            int N = max - min + 1;
            Set<String> set = new HashSet<String>();
            //if (set.isEmpty()) System.out.print("\nSET IS EMPTY");
            for (int i = min; i <= max; i++) {
                String s = "" + i;
                for (int r = 1; r < s.length(); r++) {
                    String m = returnM(s, r);
                    int num = Integer.parseInt(m);
                    String mn = s + m;
                    //System.out.printf("%d(%s)(*%d*), ", i, m, num);
                    if((num >= min) && (num <= max) && (num != i)) set.add(mn);
                }
            }
            
            //if (set.isEmpty()) System.out.print("\nSET IS EMPTY");
            int c = set.size()/2;
            System.out.printf("Case #%d: %d\n", t+1, c);
        }
    }
    
    public static String returnM(String s, int r){
        int N = s.length();
        if(r != N){
        String i = s.substring(0, N - r);
        i = s.substring(N - r, N) + i;
        return i;
        }
        else return s;
    }
}
