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

			}
		}

	}
}

/**
 * 
 */

/**
 * @author Mostafa
 *
 */
public class ReNumbersLarge {
	
	public static String traverse(String x, int index) {
		char[] m = x.toCharArray();
		int i;
		for (i=0; i<x.length(); i++) {
			m[i] = x.charAt(index);
			if (index == x.length()-1) {
				index = -1;
			}
			index++;
		}
		String t = new String(m);
		return t;
	}
	
	public static int renumber(int first, int last) {
		String[] test = new String[last-first+1];
		int i, j;
		int testc = 0;
		int count = 0;
		for (i = first; i<=last; i++) {
			String x = Integer.toString(i);
			test[testc] = x;
			testc++;
		}
		if (test[0].length() == 1) {
			count = 0;
		}
		else {
			for (i=0; i<test.length/2; i++) {
				for (j=1; j<test[i].length(); j++) {
					String s = traverse(test[i], j);
					int testme = Integer.parseInt(s);
					if (testme >= first && testme<= last && test[i].compareTo(s) != 0) {
						
						count++;
					}
				}
			}
		}
		return count;
	}
		
}
