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 com.problemC;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.HashSet;
import java.util.Set;

class RecyclePair {

	int n, m;

	public RecyclePair(int a, int b) {
		assert (a < b);
		n = a;
		m = b;
	}

	@Override
	public boolean equals(Object obj) {
		if (obj instanceof RecyclePair) {
			RecyclePair o = (RecyclePair) obj;
			if (this.n == o.n && this.m == o.m)
				return true;
		}
		return false;
	}

	@Override
	public int hashCode() {
		return n * m;
	}

}

public class RecycledNumber {

	private static int A = 1111;
	private static int B = 2222;
	public static int count = 0;
	static Set<RecyclePair> pairs = null;

	public static void main(String[] args) {
		String[] s;
		BufferedReader br = null;
		try {
			br = new BufferedReader(new FileReader(
					"src/com/problemC/C-large.in"));
			// br = new BufferedReader(
			// new FileReader("src/com/problemC/input.txt"));
			int caseNo = 1;
			int T = Integer.parseInt(br.readLine());
			while (caseNo <= T) {
				count = 0;
				pairs = new HashSet<RecyclePair>();
				s = br.readLine().split(" ");
				A = Integer.parseInt(s[0]);
				B = Integer.parseInt(s[1]);
				for (int i = A; i < B; i++) {
					rotate(i);
				}
				System.out.println("Case #" + caseNo++ + ": " + pairs.size());
			}
		} catch (NumberFormatException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		} finally {
			try {
				if (br != null) {
					br.close();
				}
			} catch (IOException e) {
				e.printStackTrace();
			}

		}
	}

	private static void rotate(int num) {
		int l = (num + "").length(), l2;
		int toCut = 1;
		int original = num, newNum;
		String s = num + "", firstPart, secondPart;
		// if(num%10==0) return;
		// System.out.println("");
		// System.out.println("Original Number in question: " + s);
		for (toCut = 0; toCut <= l; toCut++) {
			firstPart = s.substring(0, l - toCut);
			secondPart = s.substring(l - toCut);
			newNum = Integer.parseInt(secondPart + firstPart);
			// System.out.println(firstPart + " " + secondPart + ": " + newNum);
			l2 = (newNum + "").length();
			if (l == l2 && (original < newNum && newNum <= B)) {
				RecyclePair rp = new RecyclePair(original, newNum);
				if (!pairs.add(rp)) {
					// System.out.println("NO ***********************************************");
				}
				// System.out.println("YES : " + original + " " +
				// newNum+" "+count);
				// System.out.println("");
				count++;
			}
		}
	}
}
