package jp.funnything.competition.util;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.math.BigDecimal;
import java.math.BigInteger;

import org.apache.commons.io.IOUtils;

public class QuestionReader {
    private final BufferedReader _reader;

    public QuestionReader( final File input ) {
        try {
            _reader = new BufferedReader( new FileReader( input ) );
        } catch ( final FileNotFoundException e ) {
            throw new RuntimeException( e );
        }
    }

    public void close() {
        IOUtils.closeQuietly( _reader );
    }

    public String read() {
        try {
            return _reader.readLine();
        } catch ( final IOException e ) {
            throw new RuntimeException( e );
        }
    }

    public BigDecimal[] readBigDecimals() {
        return readBigDecimals( " " );
    }

    public BigDecimal[] readBigDecimals( final String separator ) {
        final String[] tokens = readTokens( separator );

        final BigDecimal[] values = new BigDecimal[ tokens.length ];
        for ( int index = 0 ; index < tokens.length ; index++ ) {
            values[ index ] = new BigDecimal( tokens[ index ] );
        }

        return values;
    }

    public BigInteger[] readBigInts() {
        return readBigInts( " " );
    }

    public BigInteger[] readBigInts( final String separator ) {
        final String[] tokens = readTokens( separator );

        final BigInteger[] values = new BigInteger[ tokens.length ];
        for ( int index = 0 ; index < tokens.length ; index++ ) {
            values[ index ] = new BigInteger( tokens[ index ] );
        }

        return values;
    }

    public int readInt() {
        final int[] values = readInts();

        if ( values.length != 1 ) {
            throw new IllegalStateException( "Try to read single interger, but the line contains zero or multiple values" );
        }

        return values[ 0 ];
    }

    public int[] readInts() {
        return readInts( " " );
    }

    public int[] readInts( final String separator ) {
        final String[] tokens = readTokens( separator );

        final int[] values = new int[ tokens.length ];
        for ( int index = 0 ; index < tokens.length ; index++ ) {
            values[ index ] = Integer.parseInt( tokens[ index ] );
        }

        return values;
    }

    public long readLong() {
        final long[] values = readLongs();

        if ( values.length != 1 ) {
            throw new IllegalStateException( "Try to read single interger, but the line contains zero or multiple values" );
        }

        return values[ 0 ];
    }

    public long[] readLongs() {
        return readLongs( " " );
    }

    public long[] readLongs( final String separator ) {
        final String[] tokens = readTokens( separator );

        final long[] values = new long[ tokens.length ];
        for ( int index = 0 ; index < tokens.length ; index++ ) {
            values[ index ] = Long.parseLong( tokens[ index ] );
        }

        return values;
    }

    public String[] readTokens() {
        return readTokens( " " );
    }

    public String[] readTokens( final String separator ) {
        return read().split( separator );
    }
}

package GoogleCodeJam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.Hashtable;

public class RecycledNumbers {
	public static void main(String[] args) {
		
		try{
			BufferedReader br = new BufferedReader(new FileReader("F:/codingContest/recyledNumbersInput.txt"));
			BufferedWriter bw = new BufferedWriter(new FileWriter("F:/codingContest/output.txt"));
			String strLine;
			
			int T=0;
			
		    if ((strLine = br.readLine().trim()) != null)   {
		    	T = Integer.parseInt(strLine);
		    	if(T >= 1 && T <= 50){
		    		int A, B, count;
		    		String p1, p2, p;
		    		Hashtable<String, String> prev = null;
				    for(int testCase = 0; testCase < T; testCase++){
				    	strLine = br.readLine().trim();
					    A = Integer.parseInt(strLine.substring(0, strLine.indexOf(' ')));
					    B = Integer.parseInt(strLine.substring(strLine.indexOf(' ')).trim());
					    count = 0;
					    prev = new Hashtable<String, String>();
					    if((A + "").length() == (B + "").length()){
					    	for (int i = A, j; i < B; i++) {
								for (j = 1; j < (i + "").length(); j++) {
									p1 = (i + "").substring(0, (i + "").length()-j);
									p2 = (i + "").substring((i + "").length()-j);
									p = p2 + p1.substring(0, p1.length());
									if((i + "").length() == (Integer.parseInt(p)+"").length() && B >= Integer.parseInt(p) && i < Integer.parseInt(p) && !prev.containsKey(i+","+p)){
										prev.put(i+","+p, "");
										count++;
									}
								}
							}
					    }
					    bw.write("Case #"+(testCase+1)+": "+ count);
					    bw.newLine();
				    }
				    bw.flush();
				    bw.close();
				    br.close();
		    	}
		    }
		}catch (Exception e) {
			e.printStackTrace();
		}
	}
}
