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

public class Recycled{

    private Scanner input;

    private int min = 0;
    private int max = 0;
    
    private ArrayList<ArrayList<Integer>> list;

    public Recycled(){
        input = new Scanner(System.in);
        list = new ArrayList<ArrayList<Integer>>();
    }

    public void run(){
        precompute(2000000);
        int T = input.nextInt();
        for(int i = 1; i<=T; i++){
            int A = input.nextInt();
            int B = input.nextInt();
            System.out.printf("Case #%d: %d\n",i,check(A,B));
        }
    }

    public void precompute(int max){
        list.add(new ArrayList<Integer>());
        for(int i = 1; i <= max; i++){
            list.add(new ArrayList<Integer>());
            String n = String.valueOf(i);
            for(int m = 1; m<n.length(); m++){
                String temp = n.substring(m).concat(n.substring(0,m));
                if(temp.charAt(0) != '0' && !temp.equals(n) && !list.get(i).contains(Integer.valueOf(temp))){
                    list.get(i).add(Integer.valueOf(temp));
                }
            }
        }
    }

    public int check(int A, int B){
        if(A == B)
            return 0;
        int result = 0;
        for(int n = A; n < B; n++){
            for(Integer i: list.get(n)){
                if(i >= n && i <= B){
                    result++;
                }
            }
        }
        return result;
    }

    public static void main(String[] args){
        Recycled object = new Recycled();
        object.run();
    }

}
