package jp.funnything.competition.util;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.math.BigDecimal;
import java.math.BigInteger;

import org.apache.commons.io.IOUtils;

public class QuestionReader {
    private final BufferedReader _reader;

    public QuestionReader( final File input ) {
        try {
            _reader = new BufferedReader( new FileReader( input ) );
        } catch ( final FileNotFoundException e ) {
            throw new RuntimeException( e );
        }
    }

    public void close() {
        IOUtils.closeQuietly( _reader );
    }

    public String read() {
        try {
            return _reader.readLine();
        } catch ( final IOException e ) {
            throw new RuntimeException( e );
        }
    }

    public BigDecimal[] readBigDecimals() {
        return readBigDecimals( " " );
    }

    public BigDecimal[] readBigDecimals( final String separator ) {
        final String[] tokens = readTokens( separator );

        final BigDecimal[] values = new BigDecimal[ tokens.length ];
        for ( int index = 0 ; index < tokens.length ; index++ ) {
            values[ index ] = new BigDecimal( tokens[ index ] );
        }

        return values;
    }

    public BigInteger[] readBigInts() {
        return readBigInts( " " );
    }

    public BigInteger[] readBigInts( final String separator ) {
        final String[] tokens = readTokens( separator );

        final BigInteger[] values = new BigInteger[ tokens.length ];
        for ( int index = 0 ; index < tokens.length ; index++ ) {
            values[ index ] = new BigInteger( tokens[ index ] );
        }

        return values;
    }

    public int readInt() {
        final int[] values = readInts();

        if ( values.length != 1 ) {
            throw new IllegalStateException( "Try to read single interger, but the line contains zero or multiple values" );
        }

        return values[ 0 ];
    }

    public int[] readInts() {
        return readInts( " " );
    }

    public int[] readInts( final String separator ) {
        final String[] tokens = readTokens( separator );

        final int[] values = new int[ tokens.length ];
        for ( int index = 0 ; index < tokens.length ; index++ ) {
            values[ index ] = Integer.parseInt( tokens[ index ] );
        }

        return values;
    }

    public long readLong() {
        final long[] values = readLongs();

        if ( values.length != 1 ) {
            throw new IllegalStateException( "Try to read single interger, but the line contains zero or multiple values" );
        }

        return values[ 0 ];
    }

    public long[] readLongs() {
        return readLongs( " " );
    }

    public long[] readLongs( final String separator ) {
        final String[] tokens = readTokens( separator );

        final long[] values = new long[ tokens.length ];
        for ( int index = 0 ; index < tokens.length ; index++ ) {
            values[ index ] = Long.parseLong( tokens[ index ] );
        }

        return values;
    }

    public String[] readTokens() {
        return readTokens( " " );
    }

    public String[] readTokens( final String separator ) {
        return read().split( separator );
    }
}

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

public class codejam1{

    public static void main(String [] args){
        HashMap<Integer, Integer> permuToPairs = new HashMap<Integer, Integer>();
        permuToPairs.put(1,0);
        permuToPairs.put(2,1);
        permuToPairs.put(3,3);
        permuToPairs.put(4,6);
        permuToPairs.put(5,10);
        permuToPairs.put(6,15);
        permuToPairs.put(7,21);
        //System.out.println(findRecycle(1111, 2222,permuToPairs));
        int count = 1;
        try{
            Scanner sc = new Scanner(new File("C-small-attempt0.in"));
            PrintStream ps = new PrintStream(new File("OutputFile"));
            sc.nextLine();
            while (sc.hasNextLine()){
                String line  = sc.nextLine();
                String[] numbers = line.split(" ");
                long low = Long.parseLong(numbers[0]);
                long high = Long.parseLong(numbers[1]);
                
                String s = "Case #"+count+": " + findRecycle(low, high,permuToPairs);
                if(sc.hasNextLine()){
                    s +="\n";
                }
                ps.print(s);
                count ++;
            }
        }catch(Exception e){
            
        }
    }   
    
    public static long findRecycle(long low, long high, HashMap<Integer, Integer> permuToPairs){
        Set<Long> numberSet = new HashSet<Long>();
        String numberString = low+"";
        int numWidth = numberString.length();
        long count = 0;
        for(long i = low; i<= high; i++){
            if(!numberSet.contains(i)){
                numberSet.add(i);
                long permuNumber = i;
                int numPermus = 1;
                for(int j = 0; j < numWidth; j++){
                    // permute the number
                    permuNumber = permuNumber % 10* (int)Math.pow(10, numWidth-1)+permuNumber/10;
                    if(permuNumber >= low && permuNumber <= high && !numberSet.contains(permuNumber)){
                        numPermus++;
                        numberSet.add(permuNumber);
                    }
                }
                count += permuToPairs.get(numPermus);
            }
        }
        return count;
        
    }
}