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.File;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.PrintStream;
import java.util.HashSet;
import java.util.Scanner;

// Qualification Round 2012
// Problem C

public class RecycledNumbers {

	public static void main(String[] args) {
		Scanner sc = null;
		try {
			sc = new Scanner(new File("C-large.in"));
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}

		PrintStream output = null;

		try {
			output = new PrintStream(new File("C-large.out"));
		} catch (IOException e) {
			e.printStackTrace();
		}

		int cases = sc.nextInt();
		sc.nextLine();

		for(int c = 0; c < cases; c++){
			int A = sc.nextInt();
			int B = sc.nextInt();
			HashSet<String> pairs = new HashSet<String>(); 

			for(int n = A; n <= B; n++){
				String testn = n + "";
				String testm = testn;
				int l = testn.length();

				for(int i = 0; i < l - 1; i++){
					testm = testm.charAt(l - 1) + testm.substring(0, l - 1);
					int m = Integer.parseInt(testm);
					if(n < m && m <= B && m > A){
						pairs.add(n + " " + m);
					}
				}

			}
			
			System.out.printf("Case #%d: %s\n", c + 1, pairs.size());
			output.printf("Case #%d: %s\n", c + 1, pairs.size());
		}
	}
}
