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);
	}
}


package codejam;

import java.io.*;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;

/**
 *
 * @author Ronak
 */
public class C {    
    public static void main(String[] args) throws FileNotFoundException, IOException {
        
        File f = new File("C-small-attempt1.in");
        FileInputStream fstream = new FileInputStream(f);
        DataInputStream in = new DataInputStream(fstream);
        BufferedReader br = new BufferedReader(new InputStreamReader(in));
        String strLine = "";
        int count = 0, T = 0;
        List<String> left = new ArrayList<String>();
        while ((strLine = br.readLine()) != null) {
            if (count == 0) {
                T = Integer.parseInt(strLine.trim());
            } else {
                strLine.trim();
                String[] l = strLine.split(" ");
                int min = Integer.parseInt(l[0]);
                int max = Integer.parseInt(l[1]);                
                System.out.print("Case #" + count + ": ");
                for (int n = min; n <= max; n++) {
                    String str = String.valueOf(n);
                    for (int i = 1; i < str.length(); i++) {
                        String temp = str.substring(i, str.length()) + str.substring(0, i);
                        if (temp.charAt(0) != '0') {
                            int m = Integer.parseInt(temp);
                            if (n < m && m <= max && n >= min) {
                                left.add(n + "" + m + "");
                            }
                        }
                    }
                }
                System.out.println(new ArrayList<String>(new HashSet<String>(left)).size());
                left.clear();
            }
            count++;
        }
    }
}
