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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Arrays;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;

public class RecycledPairs {

	
	public static void main(String args[]) throws IOException {
		BufferedWriter resultWriter = new BufferedWriter(new FileWriter("C:\\Users\\Andriy\\workspaces\\codejam\\RecycledPairs\\src\\datasetOutput"));
		BufferedReader reader = new BufferedReader(new FileReader("C:\\Users\\Andriy\\Downloads\\C-small-attempt0.in"));
		int totalCases = Integer.parseInt(reader.readLine());
		int caseNumber = 0;
		while (++caseNumber <= totalCases) {
			String[] numbers = reader.readLine().split(" ");
			if (numbers.length != 2 || numbers[0].length() == 1) {
				resultWriter.write(String.format("Case #%d: %d\n", caseNumber, 0));
				continue;
			}
			int a = Integer.parseInt(numbers[0]);
			int b = Integer.parseInt(numbers[1]);
			int recycles = 0;
			
			final char[] buffer = new char[numbers[0].length()];
			for (int m = a+1; m <= b; m++) {
				final char[] mChar = String.valueOf(m).toCharArray();
				for (int n=a; n < m; n++) {
					final char[] nChar = String.valueOf(n).toCharArray();
					int length = 0;
					while (++length < mChar.length) {
						// skip leading zeros
						final int pivotPos = nChar.length - length;
						if (pivotPos == '0') {
							continue;
						}
						System.arraycopy(nChar, pivotPos, buffer, 0, length);
						System.arraycopy(nChar, 0, buffer, length, pivotPos);
						
						if (Arrays.equals(buffer, mChar)) {
							recycles++;
							break;
						}
					}
				}
			}
			resultWriter.write(String.format("Case #%d: %d\n", caseNumber, recycles));
		}
		resultWriter.flush();
		resultWriter.close();
	}
}
