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 Qual2012;
import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;


public class Qual2012C {
	
	public static void main(String args[]){

		String filePath = "X:\\GCJ\\2012C-small-attempt0.in";
//		String filePath = "X:\\GCJ\\2012C-large-attempt0.in";
		FileInputStream fis = null;
		BufferedReader readFile = null;
        String line;
        
        try {
        	fis = new FileInputStream(filePath);
            readFile = new BufferedReader(new InputStreamReader(fis, "ISO-8859-1"));
            line = readFile.readLine();
            int T = Integer.parseInt(line);
            for (int i = 1; i <= T; i++) {
            	line = readFile.readLine();
            	System.out.println("Case #" + i + ": " + solve(line) );
            }
        }
        catch(Exception e) {
            e.printStackTrace();
        }finally{
            try {
                fis.close();
                readFile.close();
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
	}
	
	private static int solve (String line) {
		
		String[] temp = line.split(" ");
		int a = Integer.parseInt(temp[0]);
		int b = Integer.parseInt(temp[1]);
		
		int ret = 0;
		
		for (int i = a; i < b; i++) 
			ret += count(i, b);
		
		return ret;
	}
	
	private static int count(int x, int b) {
		
		int ret = 0;
		int digitnum = 0;
		int temp = x;
		boolean[] isCounted = new boolean[b + 1];
		
		while (temp > 0) {
			digitnum ++;
			temp /= 10;
		}
		
		for (int i = 10; i <= x; i *= 10) {
			int target = 0;
			target += x / i;
			target += (x % i) * (Math.pow(10, digitnum) / i);
			if (target > x && target <= b && !isCounted[target] ) {
				ret++;
				isCounted[target] = true;
			}
		}
		return ret;
	}
}
