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 quals;

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class Recycler {

	public static void main(String args[]) {
		try {
			System.setIn(new FileInputStream("C-large.in"));
			Scanner scanner = new Scanner(System.in);

			int testCases = scanner.nextInt();
			scanner.nextLine();

			for (int i = 1; i <= testCases; i++) {
				int a = scanner.nextInt();
				int b = scanner.nextInt();

				int numRecycledPairs = recycler(a, b);
				System.out.println(String.format("Case #%d: %d", i,
						numRecycledPairs));
			}
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
		
	}

	private static int recycler(int a, int b) {
		int numRecycled = 0;
		
		int digits = (int) Math.log10(a) + 1;


		Set<Integer> recycled = new HashSet<Integer>();
		for (int m = a; m <= b; m++) {
			for (int pos = 1; pos <= digits; pos++) {
				int n = recycle(m, pos);
				if (m < n && n <= b && !recycled.contains(n)) {
					numRecycled++;
					recycled.add(n);
				}
			}
			recycled.clear();
		}
		return numRecycled;
	}
	
	private static int recycle(int a, int pos) {
		return a / (int) Math.pow(10, pos) + (a % (int) Math.pow(10, pos))
				* (int) Math.pow(10, (int) Math.log10(a) - pos + 1);
	}
}
