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.LinkedList;
import java.util.HashMap;
import java.util.Scanner;

public class Recycled
{
	public static void main(String[] args) throws Exception
	{
        HashMap<Integer,LinkedList<String>> lol = new HashMap<Integer,LinkedList<String>>(); 
        
        for( int i = 1 ; i <= 2500; i++ )
        {
            LinkedList<String> ll = new LinkedList<String>();
            String _i = i + "";
            for( int k = 0 ; k < _i.length();k++)
            {
                String t = _i.substring( k , _i.length() ) + _i.substring( 0 , k );
                for( int j = 4 - t.length(); j >= 0; j-- )
                {
                    ll.add( t );
                    t = t + "0";
                }
            }
            
            lol.put( i , ll );
                
        }
    
		Scanner in = new Scanner( System.in );
		
		int size = in.nextInt();
        
		for( int pos = 1 ; pos <= size ;pos++ )
		{
			int A = in.nextInt();
			int B = in.nextInt();
			
			String _A = A + "";
			String _B = B + "";
			
            int count = 0;
            
			for( int i = A ; i < B ; i++ )
			{
				String a = i + "";
				if( a.length() != _A.length() ) continue;
				for( int j = i + 1; j <= B; j++ )
				{
					String b = j + "";
					if( b.length() != _B.length() ) continue;
                    
                    LinkedList<String> ll = lol.get( i );
                    if( ll.contains( b ) )
                    {
                        count++;
                    }	
				}
			}
			
			
			System.out.println("Case #" + pos + ": " + count);
		}
	}
}