import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.PrintWriter;

public class RecycledNumbers {

	public RecycledNumbers() {
		solve();
	}

	/**
	 * Solves Problem A. Speaking in Tongues
	 */
	private void solve() {
		try {
			File f = new File("./C-small-attempt0.in.txt");
			File output = new File("./output2.out");

			if (output.exists())
				output.delete();

			output.createNewFile();

			PrintWriter pw = new PrintWriter(output);
			FileReader fr = new FileReader(f);
			BufferedReader br = new BufferedReader(fr);

			String linea = br.readLine();
			linea = br.readLine();

			int i = 1;
			while (linea != null) {
				int a = Integer.parseInt(linea.split(" ")[0]);
				int b = Integer.parseInt(linea.split(" ")[1]);

				pw.println("Case #" + i + ": " + getRecycledAmmount(a, b));
				linea = br.readLine();
				i++;
			}

			pw.close();
			br.close();
			fr.close();

		} catch (Exception e) {
			e.printStackTrace();
		}

	}

	private int getRecycledAmmount(int start, int end) {
		int ammount = 0;

		for (int n = start; n <= end; n++) {
			for (int m = start; m <= end; m++) {
				if (n < m && isRecycled("" + n, "" + m))
					ammount++;
			}
		}

		return ammount;
	}

	private boolean isRecycled(String n, String m) {

		for (int i = m.length()-1; i > 0; i--) {
			
			String prefix = m.substring(0, i);			
			String suffix = m.substring(i);
			
			String recycled = suffix + prefix;
			if(recycled.equals(n))
				return true;

		}

		return false;

	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		new RecycledNumbers();
	}

}
