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.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;


public class C {
	public static void main(String[] args) throws FileNotFoundException {
		Scanner read = new Scanner(new File("C-small-attempt0.in"));
		PrintWriter out = new PrintWriter(new File("c-small.out"));
		int numberOfTests = read.nextInt();
		for (int i = 1; i <= numberOfTests; i++) {
			int a = read.nextInt();
			int b = read.nextInt();
			int countOfDigits = 0;
			int t = 1;
			while (a / t != 0) {
				countOfDigits++;
				t *= 10;
			}
			t /= 10;
			int result = 0;
			for (int n = a; n < b; n++) {
				int m = n;
				for (int k = 1; k < countOfDigits; k++) {
					int lastDigit = m % 10;
					m = m / 10;
					m = lastDigit * t + m;
					if (m <= b && m > n) {
						result++;
					}
				}
			}
			
			out.println(String.format("Case #%d: %d", i, result));
		}
		out.close();
	}
}
