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.*;
import java.io.*;

public class Solution {
	public void doMain() throws Exception {
		BufferedReader in = new BufferedReader(new FileReader("input.txt"));
		PrintWriter pw = new PrintWriter(new FileWriter("output.txt"));		
		int CaseNumber = Integer.parseInt(in.readLine());		
		for (int cas=1; cas <= CaseNumber; cas++) {
			int nbr = 0 ;			
			String[] str = in.readLine().split(" ");
			int A = Integer.parseInt(str[0]);
			int B = Integer.parseInt(str[1]);
			if(A < 10) {
				pw.println("Case #"+cas+": "+nbr);
			}
			else if(A==B){
				pw.println("Case #"+cas+": "+nbr);
			}
			else{
				ArrayList<String> n = new ArrayList<String>();
				for(int i=A; i<=B; i++){
					String st = Integer.toString(i);
					int l = st.length();
					for(int j=l-1; j>0 ; j--){
						String s = st;
						s = s.substring(j) + s;
						s = s.substring(0,l);
						
						if(Integer.parseInt(s) >A && Integer.parseInt(s) <B && Integer.parseInt(s)!=i && !n.contains(""+i+"-"+s) && !n.contains(s+"-"+i)){
							n.add(s+"-"+i);
							n.add(""+i+"-"+s);
							nbr++;
						}
					}	
				}
				pw.println("Case #"+cas+": "+nbr);
			}
		}
		
		in.close();
		pw.flush();
		pw.close();
	}
	
	public static void main(String[] args) throws Exception {
		(new Solution()).doMain();
	}
}