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.util.*;

public class RecycledNumbers {
	public static void main(String[] args) {
		
		System.out.println("Enter case input:");
		
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		sc.nextLine();
		
		int[][] numbers = new int[T][2];
		for (int t = 0; t < T; t++) {
			numbers[t][0] = sc.nextInt();
			numbers[t][1] = sc.nextInt();
			sc.nextLine();
		}
		
		for (int t = 1; t <= T; t++) {
			int a = numbers[t - 1][0];
			int b = numbers[t - 1][1];
			int numRecycledPairs = 0;
			
			for (int n = a; n < b; n++) {
				String N = n + "";
				int[] matches = new int[N.length()];
				boolean duplicate = false;
				
				for (int digitFromBack = 1; digitFromBack <= N.length() - 1; digitFromBack++) {
					int newInt = Integer.parseInt(N.substring(N.length() - digitFromBack) + N.substring(0, N.length() - digitFromBack));
					if (newInt > n && newInt <= b) {
						for (int match : matches) {
							if (newInt == match)
								duplicate = true;
						}
						if (!duplicate) {
							matches[digitFromBack] = newInt;
							numRecycledPairs++;
						}
					}
				}
			}
			
			System.out.println("Case #" + t + ": " + numRecycledPairs);
		}
		
		
	}

}
