package codejam;

import java.util.*;
import java.io.*;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

import java.util.Scanner;


public class C {

    public static void main(String[] args) {
        boolean[][] isPairs = new boolean[1001][1001];
        for (int i = 1; i < 1000; i++) {
            for (int j = i+1; j < 1001; j++) {
                isPairs[i][j] = isPair(i, j);
            }
        }
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        for (int i = 0; i < t; i++) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            int count = 0;
            for (int j = a; j < b; j++) {
                for (int k = j+1; k <= b; k++) {
                    if (isPairs[j][k]) {
                        count++;
                    }
                }
            }
            System.out.println("Case #" + (i+1) + ": " + count);
            
        }
    }

    private static boolean isPair(int i, int j) {
        int digits = 0;
        int max = 1;
        int ac = i;
        while(ac > 0) {
            ac /= 10;
            digits++;
            max *= 10;
        }
        int min = max / 10;
        for (int k = 0; k < digits; k++) {
            int msb = i / min;
            i = i % min * 10 + msb;
            if (i == j) {
                return true;
            }
        }
        return false;
    }

}
