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 Recycler {

    private Scanner input;

    private int numTests = 0;

    public static void main(String[] args) {
	Scanner inp = new Scanner(System.in);
	int numChar = 0;
	numChar = inp.nextInt();
	Recycler r = new Recycler(inp, numChar);
	r.recycle();
    }

    public Recycler(Scanner inp, int numChar) {
	this.input = inp;
	this.numTests = numChar;
    }

    public void recycle() {
	for (int i = 1; (i <= numTests) && input.hasNextLine(); i += 1) {
	    int base = input.nextInt();
	    int end = input.nextInt();
	    int cycles = this.countCycles(base, end);
	    System.out.println("Case #" + i + ": " + cycles);
	}
    }

    public int countCycles(int start, int end) {
	int total = 0;
	int order = order(start);
	for (int i = start; i < end; i += 1) {
	    for (int j = i + 1; j <= end; j += 1) {
		if (isRecycled(i, j, order)) {
		    total += 1;
		}
	    }
	}
	return total;
    }

    public static boolean isRecycled(int i, int j, int order) {
	int rot = (j / 10) + (order * (j - (10 * (j / 10))));
	while (rot != j) {
	    if (rot == i) {
		return true;
	    }
	    rot = (rot / 10) + (order * (rot - (10 * (rot / 10))));
	}
	return false;
    }

    public static int order(int i) {
	int order = 0;
	while (i > 0) {
	    i /= 10;
	    order += 1;
	}
	int result = 1;
	for (int j = 1; j < order; j += 1) {
	    result *= 10;
	}
	return result;
    }
}
	    
	