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.Scanner;

public class C {
	public static void main(String args[]) {
		Scanner sc = new Scanner(System.in);
		int nCases = sc.nextInt();
		for (int i = 1; i <= nCases; i++) {
			int zzz = 0;
			int a = sc.nextInt();
			int b = sc.nextInt();

			for (int aa = a; aa <= b; aa++) {
				for (int bb = aa + 1; bb <= b; bb++) {
					if (isRecycled(aa, bb)) {
						zzz++;
					}
				}
			}
			System.out.println("Case #" + i + ": " + zzz);
		}
	}

	private static boolean isRecycled(int aa, int bb) {
		int nDigits = 0;
		int temp = aa;
		while (temp > 0) {
			nDigits++;
			temp = temp / 10;
		}

		for (int zxc = 1; zxc < nDigits; zxc++) {
			int tempa = aa;
			tempa = (tempa % (int) Math.pow(10, zxc)) * (int) Math.pow(10,(nDigits - zxc)) + tempa / (int) Math.pow(10, zxc);
			if (tempa == bb) return true;
		}
		return false;
	}
}
