package jp.funnything.competition.util;

import java.math.BigInteger;

/**
 * Utility for BigInteger
 */
public class BI {
    public static BigInteger ZERO = BigInteger.ZERO;
    public static BigInteger ONE = BigInteger.ONE;

    public static BigInteger add( final BigInteger x , final BigInteger y ) {
        return x.add( y );
    }

    public static BigInteger add( final BigInteger x , final long y ) {
        return add( x , v( y ) );
    }

    public static BigInteger add( final long x , final BigInteger y ) {
        return add( v( x ) , y );
    }

    public static int cmp( final BigInteger x , final BigInteger y ) {
        return x.compareTo( y );
    }

    public static int cmp( final BigInteger x , final long y ) {
        return cmp( x , v( y ) );
    }

    public static int cmp( final long x , final BigInteger y ) {
        return cmp( v( x ) , y );
    }

    public static BigInteger div( final BigInteger x , final BigInteger y ) {
        return x.divide( y );
    }

    public static BigInteger div( final BigInteger x , final long y ) {
        return div( x , v( y ) );
    }

    public static BigInteger div( final long x , final BigInteger y ) {
        return div( v( x ) , y );
    }

    public static BigInteger mod( final BigInteger x , final BigInteger y ) {
        return x.mod( y );
    }

    public static BigInteger mod( final BigInteger x , final long y ) {
        return mod( x , v( y ) );
    }

    public static BigInteger mod( final long x , final BigInteger y ) {
        return mod( v( x ) , y );
    }

    public static BigInteger mul( final BigInteger x , final BigInteger y ) {
        return x.multiply( y );
    }

    public static BigInteger mul( final BigInteger x , final long y ) {
        return mul( x , v( y ) );
    }

    public static BigInteger mul( final long x , final BigInteger y ) {
        return mul( v( x ) , y );
    }

    public static BigInteger sub( final BigInteger x , final BigInteger y ) {
        return x.subtract( y );
    }

    public static BigInteger sub( final BigInteger x , final long y ) {
        return sub( x , v( y ) );
    }

    public static BigInteger sub( final long x , final BigInteger y ) {
        return sub( v( x ) , y );
    }

    public static BigInteger v( final long value ) {
        return BigInteger.valueOf( value );
    }
}

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.StringTokenizer;


public class ProblemC {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		System.out.println("Problem A enter input file:");
		Scanner scan = new Scanner(System.in);
		String sFile = scan.nextLine();
		File f = new File(sFile);
		try {
			BufferedReader r  = new BufferedReader(new FileReader(sFile));
			String current;
			int cnum = 0;
			while((current = r.readLine())!=null) {
				if(cnum>0) {
					System.out.println("Case #"+cnum+": "+solve(current));
				}
				cnum ++;
			}
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

	}

	private static int solve(String current) {
		StringTokenizer tok = new StringTokenizer(current);
		int a = 0, b = 0, i = 0, s=0;
		while(tok.hasMoreElements()){
			switch(i) {
			case 0: a = Integer.parseInt((String) tok.nextElement());
			break;
			case 1: b = Integer.parseInt((String) tok.nextElement());
			}
			i++;
		}
		for(int n = a; n<b; n++) {
			for(int m = b; m > n; m--) {
				int t = m;
				int digits = String.valueOf(t).length();
				for(i = 1; i<digits; i++) {
					t = (int) ((t % 10)*Math.pow(10, digits-1) + t/10);
					if(t == n)
						s++;
				}
			}
		}
		return s;
	}

}
