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


public class C {
	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(new File("C-small-attempt0.bin"));
//		Scanner in = new Scanner(new File("test.in"));
		int T = in.nextInt();
		for (int zz = 1; zz <= T; ++zz) {
			int A = in.nextInt();
			int B = in.nextInt();
			
			int r = 0;
//			HashSet<Integer> tested = new HashSet<>();
			for (int i = A; i < B; ++i) {
				int log = (int) Math.log10(i);
				int n = i;
				int p = (int) Math.pow(10, log+1);
				HashSet<Integer> tested = new HashSet<>(log);
				for (int l = 1; l <= log; ++l) {
					n *= 10;
					n = (n%p) + (n/p);
					if (tested.add(n) && n > i && n <= B)
						r++;
				}
			}
			
			System.out.format("Case #%d: %d\n", zz, r);
		}
		
	}
}
