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

import java.io.FileInputStream;
import java.io.IOException;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

import Utils.IOStreams;

public class C_Recycled_Numbers {

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

		IOStreams streams = new IOStreams(args[0]);
		System.setIn(new FileInputStream(args[0]));

		Scanner sc = new Scanner(System.in);
		sc.nextLine();

		int caseNum = 1;

		while (sc.hasNextInt()) {
			int lowerBoundInt = sc.nextInt();
			int upperBoundInt = sc.nextInt();

			int hits = 0;
			for (int num1 = lowerBoundInt; num1 <= upperBoundInt; num1++) {

				char[] num1Str = ("" + num1).toCharArray();
				int length = num1Str.length;
				Set<Integer> num2Duplicates = new HashSet<Integer>();

				for (int startingPoint = 0; startingPoint < length; startingPoint++) {

					int index = startingPoint;
					boolean init = true;
					StringBuffer num2Str = new StringBuffer();
					while (init || index % length != startingPoint) {
						init = false;
						num2Str.append(num1Str[index % length]);
						index++;
					}

					Integer num2 = new Integer(num2Str.toString());

					if (num1 < num2 && num2 <= upperBoundInt && !num2Duplicates.contains(num2)) {
						hits++;
						num2Duplicates.add(num2);
					}
				}
			}
			streams.printLine("Case #" + (caseNum++) + ": " + hits + "\n");
		}
		
		streams.closeStreams();

	}

}
