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


public class C_Recycled {

	static boolean recycled (String n, String B, String i) {
		return (n.compareTo(i) < 0) && (i.compareTo(B) <= 0);
	}
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for (int cas = 1; cas <= T; cas++) {
			int recycledPairs = 0;
			int A = in.nextInt();
			int B = in.nextInt();
			String sB = B+"";
			for (int n = A; n < B; n++) {
				HashSet<String> hs = new HashSet<String>();
				String sn = n+"";
				for (int i = 1; i <= sn.length(); i++) {
					String si = sn.substring(i) + sn.substring(0,i);
					if (recycled(sn,sB,si))
						hs.add(si);
				}
				recycledPairs += hs.size();
			}
			if (cas > 1)
				System.out.println();
			System.out.print("Case #"+cas+": "+recycledPairs);
		}

	}

}
