import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}

import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class C {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		Set<String> recycled = new HashSet<String>();
		
		int T = in.nextInt();

		in.nextLine();

		for (int i = 1; i <= T; i++) {
			int A = in.nextInt();
			int B = in.nextInt();
			int res = 0;
			String n1,n2,n3;
			
			for (int j = A; j <= (B - 1); j++) {
				String n = Integer.toString(j);
				for (int k = 1; k<n.length(); k++){
					n1 = n.substring(k);
					n2 = n.substring(0, k);
					n3 = n1+n2;
					if (Integer.parseInt(n3) > j && Integer.parseInt(n3) <= B && !recycled.contains(n3)){
						recycled.add(n3);
						res++;
					}
				}
				recycled.clear();
			}
			
			System.out.println("Case #"+i+": "+res);
		}

	}
	
//	public static boolean checkRecycled (int n, int m){
//		boolean res = false;
//		
//		String sn = Integer.toString(n);
//		String sm = Integer.toString(m);
//		String snTemp,snTemp2,snTemp3;
//		if (n>10 && (sn.length() == sm.length())){
//			for (int i = 1; i<sn.length(); i++){
//				snTemp = sn.substring(i);
//				snTemp2 = sn.substring(0, i);
//				snTemp3 = snTemp+snTemp2;
//				if (snTemp3.equals(sm))
//					return true;
//			}
//		}
//			
//		
//		return res;
//	}
}
