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.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map.Entry;
import java.util.Scanner;
import java.util.Set;

public class C {

	public static void main(String[] args) throws IOException,
			InterruptedException {
//		Scanner in = new Scanner(new File("in/C/test.in"));
		// Scanner in = new Scanner(new File("in/C/small.in"));
		 Scanner in = new Scanner(new File("in/C/big.in"));
//		BufferedWriter bw = new BufferedWriter(new FileWriter("out/C/test.out"));
		// BufferedWriter bw = new BufferedWriter(new FileWriter(
		// "out/C/small.out"));
		 BufferedWriter bw = new BufferedWriter(new FileWriter(
		 "out/C/big.out"));

		int cases = in.nextInt();
		for (int c = 1; c <= cases; c++) {
			int low = in.nextInt();
			int high = in.nextInt();
			int length = String.valueOf(low).length();
			int count = 0;

			HashMap<Integer, List<Integer>> alr = new HashMap<Integer, List<Integer>>();

			if (length != 1) {

				int maxD = (int) Math.pow(10, length - 1);
				System.err.println("Case " + c + ": Maximum " + maxD);
				for (int k = 1; k < length; k++) {
					int playingWith = (int) Math.pow(10, k);
					int m = (int) Math.pow(10, length - k);
					System.err.println("Playing with " + playingWith);
					for (int j = low; j < high; j++) {
						int first = j / maxD;
						int toMoveFront = j % playingWith;
						int tmpFirst = toMoveFront / (playingWith / 10);
						if (tmpFirst < first)
							continue;
						int recycled = toMoveFront * m + j / playingWith;
						if (recycled > high) {
							int dif = playingWith - toMoveFront;
							j += dif;
						} else if (recycled > j) {
							List<Integer> l = alr.get(j);
							if (l == null) {
								l = new ArrayList<Integer>();
								alr.put(j, l);
							}else{
								if(l.contains(recycled))
									continue;
							}
							l.add(recycled);
							count++;
						}
					}
				}
			}
			bw.write("Case #" + (c) + ": " + count);
			System.err.println("Case #" + (c) + ": " + count);
			bw.newLine();
		}

		in.close();
		bw.flush();
		bw.close();
	}
}
