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.io.IOException;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Scanner;
import java.util.StringTokenizer;


public class CodeJam3 {
	
	
	private static HashMap<Character, Character> map = new HashMap<Character, Character>();
	private static ArrayList<String> results = new ArrayList<String>();
	
	public static void main (String args[]) throws IOException {
	
		Scanner scanner = new Scanner(args[0]);
		
		int numToParse = Integer.parseInt(scanner.nextLine());
	
		for (int i = 0; i < numToParse; i++) {
			int count = 0;
			String string = scanner.nextLine();
			StringTokenizer st = new StringTokenizer(string);
			int firstInt = Integer.parseInt(st.nextToken());
			int secondInt = Integer.parseInt(st.nextToken());
			String s = "" + firstInt;
			int length = s.length();
			for (int j = firstInt; j <= secondInt; j++) {
				ArrayList<Integer> list = new ArrayList<Integer>();
				for (int k = 1; k < length; k++) {
					String localString = "" + j;
					String sub1 = localString.substring(0, k);
					String sub2 = localString.substring(k, length);
					String newString = sub2 + sub1;
					int integer = Integer.parseInt(newString);
					if (!list.contains(integer) && integer > j && integer <= secondInt) {
						count++;
						list.add(integer);
					}
				}
			}
			String result= "Case #" + (i + 1) + ": " + count;
			System.out.println(result);
		}
	}
}
