package codejam;

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

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

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();
	}
}
