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);

			}
		}

	}
}

import java.io.File;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Scanner;

public class MainClass {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(new File("C-large.in"));
		PrintWriter out = new PrintWriter(new File("RecycledNumbers.out"));

		int N = sc.nextInt();
		for (int i = 0; i < N; i++) {
			System.out.println("For case i: " + i);
			int A = sc.nextInt();
			int B = sc.nextInt();
			long count = 0;
			String s1 = "";
			for (int j = A; j <= B; j++) {
				s1 = "" + j;
				ArrayList<String> done = new ArrayList<String>();
				for (int k = 0; k < s1.length(); k++) {
					String tempS = s1;
					tempS = s1.substring(1) + s1.charAt(0);
					if (done.contains(tempS)) {
						continue;
					} else {
						s1 = tempS;
					}
					int temp = Integer.parseInt(s1);
					if ((temp < j) && (temp >= A) && (temp <= B)) {
						count++;
						done.add(s1);

					}

				}
			}
			out.println("Case #" + (i + 1) + ": " + count);
			System.out.println("**************");
		}
		out.close();

	}

}
