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.Scanner;

public class Recycled {
	private static Scanner stdIn = new Scanner(System.in);
	
	public static String removeLeadingZeroes(String number)
	{
		// index of first non-zero digit
		int index = 0;
		// locate first non-zero digit
		while (number.charAt(index) == 0)
		{
			index++;
		}
		// return string starting at first non-zero digit
		return number.substring(index);
	}
	
	public static String duplicateString(String x)
	{
		return x + x;
	}
	
	public static boolean areRecycled(String n, String m)
	{
		// remove leading zeroes from numbers
		n = removeLeadingZeroes(n);
		m = removeLeadingZeroes(m);
		
		// check if they're same length
		if (n.length() != m.length())
		{
			return false; // numbers must have same length
		}
		
		// duplicate n to check if they're recycled
		n = duplicateString(n);
		
		// check if m is a substring of duplicated n
		if (n.contains(m))
		{
			return true;
		}
		
		// not recycled
		return false;
	}
	
	public static void main(String args[])
	{
		int T; // number of test cases
		int caseNo = 1; // number of current case
		
		// scan number of test cases
		T = stdIn.nextInt();
		
		// while there's cases to process
		while (T-- != 0)
		{
			// case variables
			int A, B, recycled;
			
			// read A and B
			A = stdIn.nextInt();
			B = stdIn.nextInt();
			
			// start with zero recycled numbers
			recycled = 0;
			
			for (int n = A; n < B; n++)
			{
				for (int m = n + 1; m <= B; m++)
				{
					// convert integers to String representaion
					String N = Integer.toString(n);
					String M = Integer.toString(m);
					
					// if they're recycled, add to total
					if (areRecycled(N, M))
					{
						recycled++;
					}
				}
			}
			
			// print results
			System.out.println("Case #" + caseNo++ + ": " + recycled);
		}
	}
}
