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.File;
import java.io.FileReader;
import java.io.IOException;
import java.util.HashSet;

public class RecycleNumber {
	public static void solution(String fileName) throws IOException {

		FileReader fileReader = new FileReader(new File(fileName));
		BufferedReader bufferedReader = new BufferedReader(fileReader);

		String textLine = bufferedReader.readLine();

		int lines = Integer.parseInt(textLine);
		int[] ret = new int[lines];
		for (int i = 0; i < lines; i++) {
			textLine = bufferedReader.readLine();
			String[] t = textLine.split(" ");
			if (t.length < 2) {
				ret[i] = 0;
				continue;
			}
			long start = Long.parseLong(t[0]);
			long end = Long.parseLong(t[1]);
			int c = 0;
			for (long j = start; j < end; j++) {
				if (start < 10)
					break;
				c += getNumber(Long.toString(j), start, end);
			}
			ret[i] = c;
		}
		for (int i = 0; i < ret.length; i++) {
			System.out.println("Case #" + (i + 1) + ": " + ret[i]);
		}
	}

	public static int getNumber(String n, long s, long e) {
		int ret = 0;
		String t = n;
		long lo = Long.parseLong(n);
		HashSet<String> map = new HashSet<String>();
		for (int i = 1; i < n.length(); i++) {
			t = n.substring(i) + n.substring(0, i);
			String ts = n+";"+t;
			if (map.contains(ts)) continue;
			else map.add(ts);
			long l = Long.parseLong(t);
			if (l <= e && l >= s && lo < l)
				ret++;
		}

		return ret;
	}

	public static void main(String[] args) throws Exception {
		solution("c:\\sql\\C-small-attempt0.in");
	}
}
