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 be.tim.recycled;

/**
 *
 * @author Tim Boeckstaens
 * @version 1.0
 */
public class Recycler {
    public String process(String line) {
        String[] split = line.split(" ");

        if(split.length != 2){
            throw new IllegalArgumentException("Foute regel");
        }

        int a = Integer.parseInt(split[0]);
        int b = Integer.parseInt(split[1]);

        int counter = 0;

        for(int i = a ; i < b; i++){

            for(int j = i + 1; j <= b; j++){
                String s = i + "";
                String t = j + "";
                char[] chars = s.toCharArray();

                for(int x = 1; x < chars.length; x++){
                    char[] result = new char[chars.length];
                    int index = 0;
                    int start = chars.length - x;
                    for(int copy = start; copy < chars.length; copy++){
                        result[index++] = chars[copy];
                    }
                    for(int end = 0; end < start; end++){
                        result[index++] = chars[end];
                    }
                    if(new String(result).equals(t)){
                        counter++;
                        break;
                    }
                }

            }

        }

        return counter + "";
    }
}

