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.HashSet;

public class RecycledPair {
	public static void main(String[] args) {

		try {

			BufferedReader br = new BufferedReader(new FileReader("input.txt"));
			BufferedWriter bw = new BufferedWriter(new FileWriter("output.txt"));
			int N;
			N = Integer.parseInt(br.readLine());
			int k,i,j;
			HashSet<Integer> set;
			for (k = 0; k < N; k++) {
				
				String[] line = br.readLine().split(" ");
				int A = Integer.parseInt(line[0]);
				int B = Integer.parseInt(line[1]);
				
				
				int counter = 0;
				

				for (i = A; i < B; i++) {
					set = new HashSet<Integer>();
					updateSet(set, i);
					for (j = i + 1; j <= B; j++) {
						if (set.contains(j)) {
							counter++;
						}
					}
				}
				bw.write("Case #" + (k+1) + ": " + counter);
				bw.newLine();
				// showSet(set);
			}

			br.close();
			bw.close();

		} catch (IOException io) {
		}

	}

	private static void updateSet(HashSet<Integer> set, int num) {

		String numStr = num + "";
		char[] numChar = numStr.toCharArray();

		int i, j;

		for (i = numChar.length - 1; i >= 1; i--) {

			if (numChar[i] != '0') {

				char[] newNum = new char[numChar.length];
				j = i;
				int counter = 0;
				newNum[counter] = numChar[j];
				counter++;
				while (counter < numChar.length) {
					if (j < numChar.length - 1) {
						j++;
					} else {
						j = 0;
					}
					newNum[counter] = numChar[j];
					counter++;
				}
				set.add(Integer.parseInt(new String(newNum)));
			}
			//set.add(num);
		}
		set.add(num);
	}
/*
	private static void showSet(HashSet<Integer> set) {

		for (Integer s : set) {
			System.out.println(s);
		}
	}
*/
}
