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

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class ProblemC {
	public static void main(String[] args) throws FileNotFoundException {
		// Scanner sc = new Scanner(new File("C-practice.in"));
		// Scanner sc = new Scanner(new File("C-small.in"));
		Scanner sc = new Scanner(new File("C-large.in"));
		int cases = sc.nextInt();
		for (int i = 1; i <= cases; i++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			long count = 0;
			for (int j = A; j <= B; j++) {
				int number = recycle(j);
				while (number != j) {
					if (number > j && number <= B) {
						count++;
					}
					number = recycle(number);
				}
			}
			// do case things here
			System.out.format("Case #%d: %d\n", i, count);
		}
	}

	private static int recycle(int n) {
		int temp = n;
		int max = 1;
		while (temp >= 10) {
			max *= 10;
			temp /= 10;
		}
		int m = n / 10 + (max * (n % 10));
		temp = n;
		while (temp % 10 == 0) {
			temp = m;
			m = m / 10 + (max * (m % 10));
		}
		return m;
	}
}
