/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package year_2012.qualification;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Set;

/**
 *
 * @author paul
 * @date 14 Apr 2012
 */
public class QuestionC {

    private static Set<Integer> getCycle(int x) {

        String s = Integer.toString(x);
        Set<Integer> set = new HashSet<Integer>();
        set.add(x);
        for (int c = 1; c < s.length(); c++) {
            String t = s.substring(c).concat(s.substring(0, c));
            set.add(Integer.parseInt(t));
        }
        return set;
        
    }

    private static Set<Integer> mask(Set<Integer> set, int a, int b) {
        Set<Integer> result = new HashSet<Integer>();

        for (int x : set) {
            if (x >= a && x <= b) {
                result.add(x);
            }
        }
        
        return result;

    }


    public static void main(String[] args) throws FileNotFoundException, IOException {

        String question = "C";

//        String name = "large";
        String name = "small-attempt0";
//        String name = "test";

        String filename = String.format("%s-%s", question, name);

        BufferedReader input = new BufferedReader(
                new FileReader(String.format("/home/paul/Documents/code-jam/2012/qualification/%s.in",
                filename)));

        String firstLine = input.readLine();

        PrintWriter pw = new PrintWriter(new File(
                String.format("/home/paul/Documents/code-jam/2012/qualification/%s.out", filename)));


        int T = Integer.parseInt(firstLine);

        // Loop through test cases.
        for (int i = 0; i < T; i++) {

//             Read data.
            String[] tokens = input.readLine().split(" ");

//            int N = Integer.parseInt(input.readLine());

            int A = Integer.parseInt(tokens[0]);
            int B = Integer.parseInt(tokens[1]);

//            System.out.format("%d, %d\n", A, B);

            boolean[] used = new boolean[B+1];
            int total = 0;
            for (int n = A; n <= B; n++) {
                if (!used[n]) {
                    Set<Integer> set = mask(getCycle(n), A, B);
                    int k = set.size();
                    total += (k * (k-1))/2;
                    for (int m : set) {
                        used[m] = true;
                    }
                }
            }

            pw.format("Case #%d: %d\n", i + 1, total);
        }

        pw.close();

    }

}

package recycle;

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.HashSet;

public class Recycle
{

	public static void main(String[] args) throws Exception
	{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		int count = Integer.parseInt(br.readLine());
		
		for(int z = 0;z < count;z++)
		{
			int n = 0;
			int dbgCnt = 0;

			HashSet<Long> used = new HashSet<Long>();
			HashSet<Long> dbgUsed = new HashSet<Long>();
			
			String[] info = br.readLine().split(" ");			
			int a = Integer.parseInt(info[0]);
			int b = Integer.parseInt(info[1]);
			char[] max = String.valueOf(b).toCharArray();
			
			for(int i = a;i < b;i++)
			{
				char[] digits = String.valueOf(i).toCharArray();
				
				for(int j = 1;j < digits.length;j++)
				{
					boolean valid = true;
					boolean low = false;
					boolean high = false;
					boolean same = true;
					for(int k = 0;k < digits.length;k++)
					{
						char comp = digits[(k + j) % digits.length];
						//System.out.println(comp + " >=" + digits[k] + " <=" + max[k]);
						if((high || comp > digits[k]) && (low || comp < max[k] || (k == digits.length - 1 && comp == max[k])))
						{
							same = false;
							break;
						}
						else if((!high && comp < digits[k]) || (!low && comp > max[k]))
						{
							valid = false;
							break;
						}
						if(digits[k] != max[k])
						{
							if(comp == digits[k])
							{
								low = true;
							}
							else if(comp == max[k])
							{
								high = true;
							}
						}
					}
					if(valid && !same)
					{
						//System.out.println("Adding");
						char[] recon = new char[digits.length];
						for(int k = 0;k < digits.length;k++)
						{
							recon[k] = digits[(j + k) % digits.length];
						}
						int num = Integer.parseInt(String.valueOf(recon));
						//System.out.println(a + " <= " + i + " < " + num + " <= " + b);
//						if(!(a <= i && i < num && num <= b))
//						{
//							System.out.println("ERROR: " + num);
//						}
//						
						if(used.contains((num) | ((long) i << 32)))
						{
//							System.out.println("Reused");
						}
						else
						{
							used.add((num) | ((long) i << 32));
							n++;
						}

//						char[] num1 = String.valueOf(i).toCharArray();
//						char[] num2 = String.valueOf(num).toCharArray();
//						for(int k = 0;k < digits.length;k++)
//						{
//							if(num1[(j + k) % digits.length] != num2[k])
//								System.out.println("ERROR!");
//						}
					}
					
					/*char[] recon = new char[digits.length];
					for(int k = 0;k < digits.length;k++)
					{
						recon[k] = digits[(j + k) % digits.length];
					}
					int num = Integer.parseInt(String.valueOf(recon));
					if(i < num && num <= b && !dbgUsed.contains((num) | ((long) i << 32)))
					{
						dbgUsed.add((num) | ((long) i << 32));
						dbgCnt++;
					}*/
				}
			}
			
			/*for(long p : dbgUsed)
			{
				if(!used.contains(p))
				{
					System.out.println((int) (p >> 32) + " " + (int) (p & 0xFFFFFFFF));
				}
			}*/
			
			System.out.println("Case #" + (z + 1) + ": " + n/* + " " + dbgCnt + ((dbgCnt != n)?" !!!":"")*/);
		}
	}
	
}
