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.*;
import java.io.*;
import java.lang.*;
import static java.lang.System.*;

public class RecycledNumbers{
	static HashSet<Integer> set;
	static int ctr, low, high;
	public static void main(String[] args) throws Exception{
		BufferedReader br = new BufferedReader(new InputStreamReader(in));
		int ii = Integer.parseInt(br.readLine());
		for(int jj=0; jj<ii; jj++){
			String[] ss = br.readLine().trim().split("\\s+");
			low = Integer.parseInt(ss[0]);
			high = Integer.parseInt(ss[1]);
			set = new HashSet<Integer>();
			ctr = 0;
			for(int i=low; i<=high; i++){
				if(!set.contains(i)){
					generate(i+"");
				}
			}
			out.printf("Case #%d: %d\n", jj+1, ctr);
		}
	}
	static void generate(String s){
		String ss = s+s;
		int tmp = 0;
		for(int i=0; i<s.length(); i++){
			int x = Integer.parseInt(ss.substring(i, i+s.length()));
			if(x>=low && x<=high && !set.contains(x)){
				// out.println(x);
				set.add(x);
				tmp++;
			}
		}
		// out.println();
		ctr+=(tmp*(tmp-1)/2);
	}
}