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

public class C {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int i=0; i<T; i++){
			int A = sc.nextInt();
			int B = sc.nextInt();
			int count = 0;
			for (int j=A; j<B; j++){
				if (j<10) {continue;}
				int[] recycles = recycles(j);
				for (int k=0; k<recycles.length; k++){
					int recycle = recycles[k];
					if (j<recycle && recycle<=B) {count++;}
				}
			}
			System.out.format("Case #%d: %d\n", i+1, count);
		}
		
	}
	private static int[] recycles(int a){
		String aStr = ((Integer) a).toString();
		int length = aStr.length();
		int[] result = new int[length-1];
		for (int i=0; i<length-1; i++){
			String recycle = aStr.substring(i+1, length)+aStr.substring(0, i+1);
			int recycleInt = Integer.parseInt(recycle);
			result[i] = recycleInt;
		}
		return result;
	}
	
}
