import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}

import java.io.File;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class C {
	static long calc(long A, long B) {
		long d[] = new long[100];
		long res = 0;
		for (long a = A; a<=B; a++) {
			long t = a;
			int n = 0;
			while (t > 0) {
				d[n++] = (t % 10);
				t /= 10;
			}
			Set<Long> set = new HashSet<Long>(); 
			for (int i=1; i<n; i++) {
				if (d[i-1]==0) continue;
				long b = 0;
				for (int j=i-1; j>=0; j--)
					b = b*10 + d[j];
				for (int j=n-1; j>=i; j--)
					b = b*10 + d[j];				
				if (a < b && b <= B && !set.contains(b)) {
					res++;
					set.add(b);
				}
			}
		}
		return res;
	}
	public static void main(String[] args) throws Exception {
		/*System.out.println(calc(10, 40));
		System.out.println(calc(1, 9));
		System.out.println(calc(100, 500));
		System.out.println(calc(1111, 2222));
		for (int i =0; i<50; i++)
			System.out.println(calc(1000000, 2000000));*/
		Scanner scanner = new Scanner(new File("c.in"));
		int T = scanner.nextInt();
		PrintWriter pw = new PrintWriter(new File("c.out"));
		for (int i=0; i<T; i++) {
			pw.printf("Case #%d: ", i+1);
			long a = scanner.nextLong(),
					b = scanner.nextLong();
			pw.println(calc(a, b));
		}
		pw.close();
	}
}
