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

import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.util.HashSet;
import java.util.Scanner;

public class Recycled {

	private int noCases;
	private int[] minBounds;
	private int[] maxBounds;
	private int[] noDigits;

	private void readFile(String filepath) {
		try {
			Scanner sc = new Scanner(new FileInputStream(new File(filepath)));
			noCases = Integer.parseInt(sc.nextLine());
			noDigits = new int[noCases];
			minBounds = new int[noCases];
			maxBounds = new int[noCases];

			for (int i = 0; i < noCases; i++) {
				String[] line = sc.nextLine().split(" ");
				noDigits[i] = line[0].length();
				minBounds[i] = Integer.parseInt(line[0]);
				maxBounds[i] = Integer.parseInt(line[1]);
			}
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
	}

	private int answer(int min, int max, int digits) {
		HashSet<Recycled.Pair> pairs = new HashSet<Recycled.Pair>();
		for (int n = min; n < max; n++) {
			for (int d = 1; d < digits; d++) {
				int m = n / (int) Math.pow(10, d) + n % (int) Math.pow(10, d)
						* (int) Math.pow(10, digits - d);

				if (m > n && m <= max) {
					pairs.add(new Pair(n,m));
				}
			}
		}
		return pairs.size();
	}

	public static void main(String args[]) {

		Recycled r = new Recycled();
		r.readFile(args[0]);

		for (int i = 1; i <= r.noCases; i++) {
			System.out.println("Case #"
					+ i
					+ ": "
					+ r.answer(r.minBounds[i - 1], r.maxBounds[i - 1],
							r.noDigits[i - 1]));
		}
	}

	private class Pair {
		int n, m;

		public Pair(int n, int m) {
			this.n = n;
			this.m = m;
		}

		@Override
		public boolean equals(Object o) {
			if (!(o instanceof Pair)) return false;
			Pair p = (Pair) o;
			if (this.n != p.n) return false;
			if (this.m != p.m) return false;
			return true;
		}

		@Override
		public int hashCode() {
			return (n + m) % 3571;
		}
	}
}
