import java.util.HashSet;
import java.util.Scanner;

public class C {

	static HashSet p = new HashSet();
	static int low;
	static int high;
	int count = 0;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int no = sc.nextInt();

		for (int i = 1; i <= no; i++) {

			p.clear();
			low = sc.nextInt();
			high = sc.nextInt();

			for (int l = low; l <= high; l++) {
				recycle(l);
			}
			System.out.println("Case #" + i + ": " + p.size());

		}
	}

	public static void recycle(int no) {

		String s = Integer.toString(no);
		for (int i = 0; i < s.length(); i++) {
			String rec = s.substring(i) + s.substring(0, i);
			int r = Integer.parseInt(rec);
			if (r != no && r >= low && r <= high) {
				int min = Math.min(r, no);
				int max = Math.max(r, no);
				String a = Integer.toString(min) + "" + Integer.toString(max);
				p.add(a);

			}
		}

	}
}

import java.io.*;
import java.util.*;

public class recycled {

	private static int digits(int num) {
		
		int sol = 1;

		while (num / 10 != 0) {
			sol *= 10;
			num /= 10;
		}

		return sol;
	}

	/**
	 * @param args
	 * @throws IOException
	 */
	public static void main(String[] args) throws IOException {

		Scanner fe = new Scanner(new FileInputStream("/home/gllera/Desktop/data.in"));
		FileWriter fs = new FileWriter("/home/gllera/Desktop/data.out");

		int cases = fe.nextInt();

		for (int i = 0; i < cases; i++) {
			int a = fe.nextInt();
			int b = fe.nextInt();

			int sol = 0;

			TreeSet<Integer> tree = new TreeSet<Integer>();
			
			for (int n = a; n < b; n++) {
				
				tree.clear();
				int digits = digits(n);
				int idigits = 10;
				int n1 = n / digits;
				int n2 = n % digits;
				
				while ( digits != 1 )
				{
					int m = n2 * idigits + n1;
					if ( n < m && m <= b && !tree.contains(m) )
					{
						tree.add(m);
						sol++;
					}
					
					digits /= 10;
					idigits *= 10;
					
					n1 = n / digits;
					n2 = n % digits;
				}
			}

			fs.write("Case #" + (i + 1) + ": " + sol + '\n');
		}

		fe.close();
		fs.flush();
		fs.close();
	}
}
