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 );
    }
}

package codejam.Y2012;

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Collections;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class RecycledNumbers {

	/**
	 * @param args
	 * @throws FileNotFoundException
	 */
	public static void main(String[] args) throws FileNotFoundException {
		Scanner sc = new Scanner(new File(
				"C:\\Documents and Settings\\vikmalik\\Desktop\\input1.txt"));

		int numCases = sc.nextInt();
		
//		System.out.println("\nCount  = " + getCount(100, 500));
		

		for (int i = 1; i <= numCases; i++) {
			int a = sc.nextInt();
			int b = sc.nextInt();
			int count;
			if(a < b){
				count = getCount(a, b);
			}else{
				count = getCount(b, a);
			}
			System.out.println("Case #" + i + ": " + count);
		}
	}

	private static int getCount(int a, int b) {
		int lim = 0;
		int count = 0;
		if (b > 10 && b < 100) {
			lim = 1;
		} else if (b >= 100) {
			lim = 2;
		}

		Set<String> numList = new HashSet<String>();
		for (int j = 1; j <= lim; j++) {
			double divFactor = Math.pow(10, j);
			
			double mulFactor = 10;

			for (int i = a; i <= b; i++) {
				int diviser = (int) (i / divFactor);
				int remider = (int) (i % divFactor);
				
				if(remider == 0 || (divFactor == 100 && remider < 10)){
					continue;
				}
				if(i>=100){
					mulFactor =100;
				}else{
					mulFactor =10;
				}

				int num = (int) (remider * mulFactor + diviser);

//				System.out.println("diviser = "+ diviser);
//				System.out.println("remider = "+ remider);
//				System.out.println("num = "+ num);
				
				if (num >= a && num <= b && i != num && i>10 ) {
					String pair;
					if(i<num){
						pair = i + " , " + num;
					}else{
						pair = num + " , " + i;
					}
					
					numList.add(pair);
				}
			}
		}
		count = numList.size();
		
//		System.out.println("The list");
//		for (String pair : numList) {
//			System.out.println(pair);
//		}

		return count;
	}

}
