package jp.funnything.competition.util;

import java.math.BigInteger;

/**
 * Utility for BigInteger
 */
public class BI {
    public static BigInteger ZERO = BigInteger.ZERO;
    public static BigInteger ONE = BigInteger.ONE;

    public static BigInteger add( final BigInteger x , final BigInteger y ) {
        return x.add( y );
    }

    public static BigInteger add( final BigInteger x , final long y ) {
        return add( x , v( y ) );
    }

    public static BigInteger add( final long x , final BigInteger y ) {
        return add( v( x ) , y );
    }

    public static int cmp( final BigInteger x , final BigInteger y ) {
        return x.compareTo( y );
    }

    public static int cmp( final BigInteger x , final long y ) {
        return cmp( x , v( y ) );
    }

    public static int cmp( final long x , final BigInteger y ) {
        return cmp( v( x ) , y );
    }

    public static BigInteger div( final BigInteger x , final BigInteger y ) {
        return x.divide( y );
    }

    public static BigInteger div( final BigInteger x , final long y ) {
        return div( x , v( y ) );
    }

    public static BigInteger div( final long x , final BigInteger y ) {
        return div( v( x ) , y );
    }

    public static BigInteger mod( final BigInteger x , final BigInteger y ) {
        return x.mod( y );
    }

    public static BigInteger mod( final BigInteger x , final long y ) {
        return mod( x , v( y ) );
    }

    public static BigInteger mod( final long x , final BigInteger y ) {
        return mod( v( x ) , y );
    }

    public static BigInteger mul( final BigInteger x , final BigInteger y ) {
        return x.multiply( y );
    }

    public static BigInteger mul( final BigInteger x , final long y ) {
        return mul( x , v( y ) );
    }

    public static BigInteger mul( final long x , final BigInteger y ) {
        return mul( v( x ) , y );
    }

    public static BigInteger sub( final BigInteger x , final BigInteger y ) {
        return x.subtract( y );
    }

    public static BigInteger sub( final BigInteger x , final long y ) {
        return sub( x , v( y ) );
    }

    public static BigInteger sub( final long x , final BigInteger y ) {
        return sub( v( x ) , y );
    }

    public static BigInteger v( final long value ) {
        return BigInteger.valueOf( value );
    }
}

import java.io.*;
import java.util.*;
import java.lang.*;
class Source2 
{
	public static void main(String[] args) throws IOException 
	{
		String s,word,buffer;
		 FileReader input = new FileReader("C-small.in");
		 BufferedReader in = new BufferedReader(input);
		File file = new File("C-small.out");
		BufferedWriter out = new BufferedWriter(new FileWriter(file));

			s = in.readLine();
		int count= Integer.parseInt(s);

		int i=1;
		 while ((s = in.readLine()) != null && s.length() != 0)
		{
			 out.write("Case #"+(i++)+": ");
				Scanner scan =new Scanner(s);
				buffer="";
			
			
				long A =Integer.parseInt(scan.next());
				long B = Integer.parseInt(scan.next());
			
				
				long ans = calculatemn(A,B);


				out.write(ans+"\n");
		}


		 out.close();
	}


	public static long calculatemn(long A,long B)
	{
		long[][] recyclepair =new long[2000000][2];
		long count=0;
		boolean check=false;
		int re_i=0;

		for(long n=A ;n<=B;n++)
		{
			check=true;
			String stn =n+"";
			String stm =n+"";
			int length =stn.length();

			for(int i=1;i<length;i++)
			{
				stm = recycle(stn,i);
				
				
				long N= Long.parseLong(stn);
				long M =Long.parseLong(stm);

			
				if(M>N&&M<=B)
				{
					boolean pass =true;
					for(int j=0;j<re_i;j++)
					{
						if(recyclepair[j][0]==N&&recyclepair[j][1]==M)
						{
							pass=false;
						}
					}




					if(pass)
					{
					count++;

					recyclepair[re_i][0] =N;
					recyclepair[re_i][1] =M;
					re_i++;
					check=false;
					}
				}
			}

		}
		return count;
	}

	public static String recycle(String stn,int num)
	{

		String last = stn.substring(stn.length()-num,stn.length());

		String first =  stn.substring(0,stn.length()-num);

		return last+first;
	}
}
