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

package com.afarok.google.codejam2012.qualificationround;

import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class CRecycledNumber {
    public static void main(String[] ags)  {
        
        //System.setIn(new FileInputStream("src/com/afarok/google/codejam2012/qualificationround/C-small-attempt0.in"));
        //System.setOut(new PrintStream(new File("src/com/afarok/google/codejam2012/qualificationround/C-small-attempt0.out")));

        Scanner stdIn = new Scanner(System.in);
        int t = stdIn.nextInt();
        
        for(int tCase = 1;tCase<=t;++tCase) {
            int a = stdIn.nextInt();
            int b = stdIn.nextInt();
            //boolean[] recycled = new boolean[b+1];
            int y=0;
            for(int i=a;i<=b;++i) {
                Set<Integer> recyledSet = new HashSet<Integer>();
                for(int x=10;;x=x*10) {
                    int r = i%x;
                    if(r==0) continue;
                    int d = i/x;
                    if(d==0) break;
                    int lenghtOfd = (int) Math.floor(Math.log10(d)) + 1;
                    
                    
                    int recycledNum = (int) (r*Math.pow(10, lenghtOfd))+d;
                    if(recycledNum<=i) continue;
                    if(recyledSet.contains(recycledNum)) continue;
                    
                    if(recycledNum>=a&&recycledNum<=b) {
                        ++y;
                        recyledSet.add(recycledNum);
                    }
                }
            }
            System.out.println("Case #"+tCase+": " + y);
        }
    }
}
