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;
import java.io.File;

public class RecycledNumbers {
	public static void main(String[] args) {
		Scanner input = null;
		boolean[][] counted;

	    try {
	        input = new Scanner(new File(args[0]));
	    } catch (Exception e) {
	        System.out.println("Please pass a correct filename as a program parameter");
	    	System.exit(1);
    	}

    	int t, a, b;

    	t = input.nextInt();
    	input.nextLine();

    	int recycledCount = 0;

    	for (int testNumber = 0; testNumber < t; testNumber++) {
	    	a = input.nextInt();
    		b = input.nextInt();
    		input.nextLine();

    		counted = getFalseArray(b-a+1);

    		// For each test case, look at all numbers between A and B as a possibleN
    		for (int possibleN = a; possibleN <= b; possibleN++) {
    			// For each possibleN, consider each recycled form
    			for (int offset = 1; offset < String.valueOf(possibleN).length(); offset++) {
    				int cycledN = Integer.parseInt(cycleRight("" + possibleN, offset));
    				// For each recycled form, consider whether it is within the appropriate range
    				if (cycledN >= a && cycledN <= b) {
    					// These numbers are cycled forms of eachother. Are they suitable?
    					if (possibleN != cycledN && counted[min(possibleN, cycledN)-a][max(possibleN, cycledN)-a] == false) {
    						counted[min(possibleN, cycledN)-a][max(possibleN, cycledN)-a] = true;
    						recycledCount++;
						}
    				}
				}
    		}

    		System.out.println("Case #" + (testNumber+1) + ": " + recycledCount);
    		recycledCount = 0;
    	}
	}

	public static String cycleRight(String number, int positions) {
		int intLen = number.length();

		while (positions > 0) {
			// Cycle one right
			number = number.charAt(intLen-1)+number.substring(0, intLen-1);
			positions--;
		}

		return number;
	}

	public static boolean[][] getFalseArray(int size) {
		boolean[][] array = new boolean[size][size];

		for (int i = 0; i < size; i++) {
			for (int j = 0; j < size; j++) {
				array[i][j] = false;
			}
		}

		return array;
	}

	public static int min(int a, int b) {
		return (a < b ? a : b);
	}

	public static int max(int a, int b) {
		return (a < b ? b : a);
	}
}