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

import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.util.Collection;
import java.util.HashSet;
import java.util.Scanner;

public class RecycledNumber {
	public static void main(String[] args) throws IOException {
		String inputFile = "C-large.in";
		Scanner input = new Scanner(new FileInputStream(inputFile));

		FileOutputStream out = new FileOutputStream(inputFile + ".out", false);
		slove(input, out);
		out.close();
	}
	
	private static void slove(Scanner input, FileOutputStream out) throws IOException
	{
		int cases = input.nextInt();
		for (int caseOrder = 1; caseOrder <= cases; caseOrder++) {
			int a = input.nextInt();
			int b = input.nextInt();
			
			long r = 0;
			for (int i = a; i <= b; i++) {
				for (int x: getRecycled(i)) {
					if (x >= a && x <= b && i < x && x > 0) {
						// System.out.printf("(%d, %d)\n", i, x);
						r++;
					}
				}
			}
			
			String outline = String.format("Case #%d: %d\r\n",  caseOrder, r);
			System.out.print(outline);
			out.write(outline.getBytes());
		}
	}
	
	private static Collection<Integer> getRecycled(int a)
	{
		String s = Integer.toString(a);
		HashSet<Integer> ret = new HashSet<Integer>();
		for (int i = 1; i < s.length(); i++) {
			String s2 = s.substring(i) + s.substring(0, i);
			if (!s2.startsWith("0")) {
				ret.add(Integer.parseInt(s2));	
			}
		}
		return ret;
	}
}
