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

public class Q3
{
	public static boolean isPermut (int a, int b)
	{
		String str = String.valueOf (a);
		for (int i = 1; i < str.length(); i++)
		{
			str = str.charAt (str.length() - 1) + str.substring (0, str.length() - 1);
			if (Integer.parseInt (str) == b)
			{
				return true;
			}
		}
		return false;
	}
	
	public static void main (String[] args) throws IOException
	{
		BufferedReader reader = new BufferedReader (new FileReader ("input-q3.txt"));
		PrintWriter writer = new PrintWriter ("output-q3.txt");
		String line = reader.readLine();
		int nb = Integer.parseInt (line);
		for (int i = 0; i < nb; i++)
		{
			line = reader.readLine();
			String[] tokens = line.split (" ");
			int min = Integer.parseInt (tokens[0]);
			int max = Integer.parseInt (tokens[1]);
			
//			System.out.printf ("\nmin %d, max %d\n", min, max);
			
			// Try all rotations
			int counter = 0;
			
			Set<Integer> set = new HashSet<Integer>();
			
			for (int val = min; val < max; val++)
			{
				String str = String.valueOf (val);
				int nbDigits = str.length();
//				System.out.println("Val : " + val + " with " + nbDigits + " digits");
				int major = String.valueOf (max).charAt (0) - '0';
				set.clear();
				
				for (int j = 1; j < nbDigits; j++)
				{
					char last = str.charAt (nbDigits - 1);
					str = str.charAt (nbDigits - 1) + str.substring (0, nbDigits - 1);
					if (last != '0' && (last - '0') <= major)
					{
//						System.out.println ("  Trying " + str);
						int res = Integer.valueOf (str);
						if (res <= max && res > val && ! set.contains (res))
						{
//							System.out.printf ("    (%d, %d)\n", val, res);
							set.add (res);
							if (! (val != res && val < res && val >= min && res <= max && isPermut (res, val)))
							{
								System.out.println("ERROR");
							}
							counter++;
						}
					}
				}
			}
//			System.out.println ("Counter : " + counter);
			writer.println ("Case #" + (i + 1) + ": " + counter);
		}
		writer.close();
		reader.close();
	}
}