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 googleCodeJam;

import static java.lang.System.out;

import java.io.BufferedReader;
import java.io.FileReader;
import java.util.Set;
import java.util.TreeSet;

public class RecycledNumbers {
  public static void main(String[] args) throws Exception {
    if (args.length == 1) {
      // opening the input
      BufferedReader in = new BufferedReader(new FileReader(args[0]));
      
      // reading the number of test cases
      String line = null;
      int numberOfTestCases = ((line = in.readLine()) != null) ? Integer.parseInt(line) : 0;
      for (int t = 0; t < numberOfTestCases; t ++) {
        line = in.readLine();
        out.print("Case #" + (t+1) + ": ");
        
        // parse input
        String[] numbers = line.split(" ");
        int n = Integer.parseInt(numbers[0]);
        int m = Integer.parseInt(numbers[1]);
        
        int counter = 0;
        StringBuffer is = new StringBuffer(128);
        String isCurrent = null;
        for (int i = n; i <= m; i ++) {
          is.append(i);
          int size = is.length();
          is.append(i);
          //
          Set<Integer> qs = new TreeSet<Integer>();
          for (int j = 0; j < size; j ++) {
            isCurrent = is.substring(j, j+size);
            int q = Integer.parseInt(isCurrent);
            if (i < q && q <= m /*&& !isCurrent.startsWith("0")*/) {
              //counter ++;
              //out.println(i + "\t" + q + "\t" + (size - j));
              qs.add(q);
            }
          }
          //
          counter += qs.size();
          is.setLength(0);
        }
        
        out.println(counter);
      }
      
      // closing the input
      in.close();
    } else {
      // show the usage
      System.err.println("Using: java googleCodeJam.RecycledNumbers input");
    }
  }

}
