package codejam;

import java.util.*;
import java.io.*;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

import java.util.Scanner;

public class C {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);

		int T = in.nextInt();

		in.nextLine();

		for (int i = 1; i <= T; i++) {
			int A = in.nextInt();
			int B = in.nextInt();
			int res = 0;
			
			for (int j = A; j <= (B - 1); j++) {
				for (int k = (j + 1); k <= B; k++) {
					if(checkRecycled(j,k))
						res++;
				}
			}
			
			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;
	}
}
