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();
    }
}

package dom.zar.jam.qualifications;

import java.util.Scanner;

public class RecycledNumbers {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int inputLines = in.nextInt();
		for (int i = 0; i < inputLines;) {
			int a = in.nextInt();
			int b = in.nextInt();						
			System.out.println("Case #" + ++i + ": "
					+ result(a, b));
		}
	}
	
	private static int result(int a, int b) {
		int size = b - a + 1;
		int[] nums = new int[size];
		for (int i = 0; i < size; ++i) nums[i] = a + i;
		
		int counter = 0;
		for (int i = 0; i < size; ++i) {
			if (nums[i] > -1) {
				counter += rotate(nums[i], a, b, nums);
				nums[i] = -1;
			}
		}		
		return counter;
	}
	
	private static int rotate(Integer n, int a, int b, int[] nums) {
		String valString = n.toString();
		int length = valString.length();
		valString = valString + valString;
		int counter = 0;
		for (int i = 1; i < length; ++i) {
			int rotated = Integer.parseInt(
					valString.substring(i, i + length));
			if (rotated > n && rotated <= b
					&& nums[rotated - a] != -1) {
				counter++;
				nums[rotated - a] = -1;
			}
		}
		return (counter * (counter + 1)) >> 1;
	}
}
