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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.StringTokenizer;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author viswas
 */
public class Recycled {


    public static void main(String [] args)throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        int t = 1;

        int T = Integer.parseInt(br.readLine());
        while(T-- > 0){

            long count = 0;
            StringTokenizer str = new StringTokenizer(br.readLine(), " ");
            int A = Integer.parseInt(str.nextToken());
            int B = Integer.parseInt(str.nextToken());

            ArrayList <Integer> Alist = new ArrayList<Integer>();

            for(int i = A; i <= B; i++){
                String s = i + "";
                String aa = s;
                int len = s.length();
                s += s;
                Alist.clear();
                for(int j = 0; j < len; j++){
                    String s1 = s.substring(j, j + len);
                    int s2 = Integer.parseInt(s1);
                    if(!Alist.contains(s2)){
                        s1 = s2 + "";
                        if(i < s2 && aa.length() == s1.length() && B >= s2){
                            count++;
                            //System.out.println(n.substring(0, len) + " " + m);
                        }
                        Alist.add(s2);
                    }
                }
            }
            System.out.printf("Case #%d: %d", t, count);
            System.out.println();
            t++;
        }
    }

}

