import java.util.HashSet;
import java.util.Scanner;

public class C {

	static HashSet p = new HashSet();
	static int low;
	static int high;
	int count = 0;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int no = sc.nextInt();

		for (int i = 1; i <= no; i++) {

			p.clear();
			low = sc.nextInt();
			high = sc.nextInt();

			for (int l = low; l <= high; l++) {
				recycle(l);
			}
			System.out.println("Case #" + i + ": " + p.size());

		}
	}

	public static void recycle(int no) {

		String s = Integer.toString(no);
		for (int i = 0; i < s.length(); i++) {
			String rec = s.substring(i) + s.substring(0, i);
			int r = Integer.parseInt(rec);
			if (r != no && r >= low && r <= high) {
				int min = Math.min(r, no);
				int max = Math.max(r, no);
				String a = Integer.toString(min) + "" + Integer.toString(max);
				p.add(a);

			}
		}

	}
}

package de.hg.codejam.tasks.io;

import java.io.BufferedWriter;
import java.io.FileWriter;
import java.io.IOException;

public abstract class Writer {

	public static String generateOutputPath(String inputPath) {
		return inputPath.substring(0, inputPath.lastIndexOf('.') + 1) + "out";
	}

	public static void print(String[] output) {
		for (String s : output)
			System.out.println(s);
	}

	public static void write(String[] output) {
		for (int i = 0; i < output.length; i++)
			System.out.println(getCase(i + 1, output[i]));
	}

	public static void write(String[] output, String path) {
		try (BufferedWriter writer = new BufferedWriter(new FileWriter(path,
				false))) {
			for (int i = 0; i < output.length; i++) {
				writer.append(getCase(i + 1, output[i]));
				writer.newLine();
				writer.flush();
			}
		} catch (IOException e) {
			e.printStackTrace();
		}

	}

	private static String getCase(int number, String caseString) {
		return "Case #" + (number) + ": " + caseString;
	}

}
