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

public class C {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for (int t = 0; t < T; t++){
			int A = in.nextInt(); int B = in.nextInt();
			int n = A;
			int res = 0;
			while (n < B) {
				res = res+recycledPair(n,B);
				n++;
			}
			System.out.println("Case #"+(t+1)+": "+res);
		}
	}
	
	private static int recycledPair(int n, int B){
		int count = 0;
		int len = Integer.toString(n).length(); //len of digits
		String nstr = Integer.toString(n);
		List<Integer> solSofar = new ArrayList<Integer>();
		
		for (int i=1; i<len;i++){
			String toMove = nstr.substring(0, i);
			String last = nstr.substring(i);
			String mstr = last + toMove;
			Integer m = Integer.parseInt(mstr);
			if (mstr.length()==len && n < m && m <= B && !solSofar.contains(m)) {
				solSofar.add(m);
				count++;
			}
		}
		return count;
	}

}
