import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

import java.util.*;

public class Recycle {
	static boolean[][] recycled = new boolean[10000][10000];

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);

		int T = scan.nextInt();
		for (int i = 0; i < T; i++) {
			int min = scan.nextInt();
			int max = scan.nextInt();

			int count = 0;
			for (int n = min; n < max; n++) {
				int len = len(n);
				for (int m = n + 1; m < Math.min((int)Math.pow(10, len), max + 1); m++) {
					if (recycled[n][m])
						count++;
					else if (isRecycled(n, m)) {
						count++;
						if (m <= recycled.length)
							recycled[n][m] = true;
					}
				}
			}
			System.out.println("Case #" + (i + 1) + ": " + count);
		}
	}

	static int len(int a) {
		int d = 1, len = 0;
		while (a / d > 0) {
			len++;
			d *= 10;
		}
		return len;
	}

	static boolean isRecycled(int n, int m) {
		int l = len(n);
		if (l != len(m))
			return false;

		int d = 10;
		int pow = (int)Math.pow(10, l);
		while (n / d > 0) {
			if ((n % d) * (pow / d) + n / d == m)
				return true;
			d *= 10;
		}
		return false;
	}
}
