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.*;
import java.util.*;

public class Main {
	public static void main(String... args) throws Exception {
		int t, a, b, T;
		Scanner in = new Scanner(new File("recycled.in"));
		//PrintStream out = System.out;
		PrintStream out = new PrintStream(new File("recycled.out"));
		T = in.nextInt();
		for (t = 1; t <= T; t++) {
			a = in.nextInt();
			b = in.nextInt();
			int rez = 0;
			int i, j;
			int n = (a + "").length();
			String B = b + "";
			for (i = a; i <= b; i++) {
				String I = i + "";
				Set<String> s = new TreeSet<String>();
				s.add(I);
				for (j = 1; j < n; j++) {
					String x = I.substring(j) + I.substring(0, j);
					if (I.compareTo(x) < 0 && x.compareTo(B) <= 0 && s.add(x)) {
						rez++;
					}
				}
			}
			out.println("Case #" + t + ": " + rez);
		}
	}

}
