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();
	}
}

package gcj2012;

import java.io.FileInputStream;
import java.io.PrintStream;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;

public class C {

	public static void main(String[] args) throws Exception {
		new C().run();
	}

	void run() throws Exception {
		Scanner in = new Scanner(System.in);
		in = new Scanner(new FileInputStream("C-small-attempt0.in"));
		in = new Scanner(new FileInputStream("C-large.in"));
		PrintStream out = System.out;
		out = new PrintStream("C-small-attempt0.out");
		out = new PrintStream("C-large.out");

		int T = in.nextInt();
		for (int x = 1; x <= T; x++) {
			int A = in.nextInt();
			int B = in.nextInt();
			out.printf("Case #%d: %d\n", x, countRecycled(A, B));
		}

	}

	private int countRecycled(int a, int b) {
		int res = 0;
		int p0 = 1;
		while (p0 < b)
			p0 *= 10;
		for (int s = a; s <= b; s++)
			res += countRecycledStartingBy(a, b, s, p0);
		return res;
	}

	private int countRecycledStartingBy(int a, int b, int s, int p0) {
		int p = 1;
		Set<Integer> recs = new TreeSet<Integer>();
		while (p < 1000000) {
			int end = s % p;
			int beg = s / p;
			int rec = end * p0 + beg;
			if (rec >= a && rec <= b && rec != s && s < rec) recs.add(rec);
			p *= 10;
			p0 /= 10;
		}
		return recs.size();
	}

}
