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.util.Scanner;
import java.util.Set;
import java.util.TreeSet;


public class C {
	
	C() {
		Scanner in=new Scanner(System.in);
		for (int T=in.nextInt(),TC=1; T-->0; ++TC) {
			int A=in.nextInt(),B=in.nextInt();
			int cnt=0;
			for (int m=2; m<=B; ++m)
				cnt+=count(A,m);
			System.out.printf("Case #%d: %d%n", TC,cnt);
		}
	}
	
	int count(int A, int m) {
		String s = Integer.toString(m); // 345
		Set<Integer> set=new TreeSet<Integer>();
		for (int i=1; i<s.length(); ++i) {
			if (s.charAt(i)!='0') {
				String t = s.substring(i)+s.substring(0,i);
				int n = new Integer(t);
				if (A<=n && n<m)
					set.add(n);
			}
		}
		return set.size();
	}

	public static void main(String[] args) {
		new C();
	}

}
