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.*;

public class QualC12 {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();	
		for (int i = 1; i <= T; i++) {
			int A = in.nextInt();
			int B = in.nextInt();
			int npairs = 0;
			for (int j = A; j <= B; j++) {
				String s = String.valueOf(j);
				String ns = s + s;
				boolean containsRepeat = false;
				for (int k = 1; k < s.length(); k++) {
					String rot = ns.substring(k, k + s.length());
					int rnum = Integer.valueOf(rot);
					if (rnum > j && rnum <= B && String.valueOf(rnum).length() == s.length()) {
						if (containsRepeat(s)) containsRepeat = true;
						++npairs;
					}
				}
				if (containsRepeat) --npairs;
			}
			System.out.println("Case #" + i + ": " + npairs);
		}
	}

	private static boolean containsRepeat(String s) {
		if (s.length() % 2 != 0) return false;
		if (s.substring(0, s.length()/2).equals(s.substring(s.length()/2, s.length()))) {
			return true;
		}
		else return false;
	}

}