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

/**
 *
 * @author JoeJev
 */
public class ProblemC {

    Scanner scan;

    public ProblemC(Scanner scan) {
        this.scan = scan;
    }
    
    public void processProblem(){
        int cases = scan.nextInt();
        for (int m = 1; m <= cases; m++){
            System.out.println("Case #" + m + ": " + amountRecycled(scan.nextInt(), scan.nextInt()));
        }
    }

    private int amountRecycled(int n, int m) {
        int result = 0;
        int parsedInt;
        for (int o = n; o <= m; o++)
            for (int p = String.valueOf(o).length(); p > 0; p--){
                parsedInt = Integer.parseInt(String.valueOf(o).substring(p) + String.valueOf(o).substring(0, p));
                    if (parsedInt <= m && parsedInt >= n && parsedInt != o)
                        result++;
            }
        return result / 2;
    }
}
