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

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package googlecodejam2012;

import java.io.FileNotFoundException;
import java.util.*;

/**
 *
 * @author Pavlos
 */
public class ProblemC {
    
      public static void main(String[] args) throws FileNotFoundException {
        Read.OpenFile("C-small-attempt0.in");
        Write.OpenFile("solC.txt");
        int T = Read.readInt();
        for (int zz = 1; zz <= T; zz++) {
            int A = Read.readInt();
            int B = Read.readInt();
            
            int size = String.valueOf(A).length();
            ArrayList<Integer> As = new ArrayList<>();
            ArrayList<Integer> Temps = new ArrayList<>();
            
            for (int i = A; i <= B; i++) {
                int temp = i;
                for (int j = 0; j < size; j++) {    
                    int suf = temp%10;
                    temp /= 10;
                    temp += suf*(Math.pow(10, size-1));
                    if(temp <= B && temp >= A && i < temp && temp != i)
                    {
                        if(As.indexOf(i)== Temps.indexOf(temp) && As.indexOf(i) != -1 && Temps.indexOf(temp)!=-1)
                            continue;
                         As.add(i);
                         Temps.add(temp);
                    }
                }
                
            }
           
            Write.WriteToFile(String.format("Case #%d: %d\n",zz,As.size()));
            
        }//end zz
        Write.CloseFile();
    }
}

