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

import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Scanner;

public class Recycled {
    private static String fileName = "recycled-small";
    private static String inputFileName = fileName + ".in";
    private static String outputFileName = fileName + ".out";
    private static Scanner in;
    private static PrintWriter out;
    private static int MIN = 12;
    private static int MAX = 1000;
    private static ArrayList<ArrayDeque<Integer>> data = new ArrayList<ArrayDeque<Integer>>(MAX-MIN);

    private static void calcData() {
        for (int i = MIN; i < MAX; i++) {
            String value = String.valueOf(i);
            String concatValue = value.concat(String.valueOf(i));
            ArrayDeque<Integer> goodShifts = new ArrayDeque<Integer>(value.length());
            HashSet<Integer> alreadyProcessed = new HashSet<Integer>(value.length());
            for (int n = 1; n < value.length(); n++) {
                String shiftedValue = concatValue.substring(n, n + value.length());
                int shiftedNum = Integer.parseInt(shiftedValue);
                if (!alreadyProcessed.contains(shiftedNum)) {
                    alreadyProcessed.add(shiftedNum);
                    if ((i < shiftedNum) && (shiftedNum <= MAX) && (value.length() == shiftedValue.length())) {
                        goodShifts.add(shiftedNum);
                    }
                }
            }
            data.add(goodShifts);
        }
    }

    private void solve() {
        int A = in.nextInt();
        int B = in.nextInt();
        int numRecycled = 0;
        for (int n = ((A < MIN) ? MIN : A); n < B; n++) {
            ArrayDeque<Integer> goodShifts = data.get(n-MIN);
            for (Integer m : goodShifts) {
                if (m <= B) {
                    numRecycled++;
                }
            }
        }
        out.print(numRecycled);
    }

    /**
     * @param args
     * @throws FileNotFoundException
     */
    public static void main(String[] args) throws FileNotFoundException {
        calcData();
        in = new Scanner(new FileReader(inputFileName));
        out = new PrintWriter(outputFileName);
        int tests = in.nextInt();
        in.nextLine();
        for (int t = 1; t <= tests; t++) {
            out.print("Case #" + t + ": ");
            new Recycled().solve();
            out.println();
        }
        in.close();
        out.close();
    }

}
