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.util.*;
public class C {

	public static void main (String[] args)
	{	
			String bIn;
			Scanner in = new Scanner(System.in);
			
			int T = Integer.parseInt(in.nextLine());
			
			for (int test = 0 ; test < T ; test++)
			{
				String range = in.nextLine();
				String[] cIN = range.split(" ");
				int max = Integer.parseInt(cIN[1]);
				int min = Integer.parseInt(cIN[0]);
				int count = 0;
				for (int findPair = min ; findPair <= max ; findPair ++)
				{
					String thisOne = String.valueOf(findPair);
					
					String[] gothrough = thisOne.split("");
					int digitLength = gothrough.length-1;
					
					int sameTest = Integer.parseInt(thisOne);
					
				//	System.out.println(digitLength);
					
					for (int shuffle1 = 0 ; shuffle1 < digitLength ; shuffle1++)
					{
		
							String temp = thisOne.substring(shuffle1)+thisOne.substring(0,shuffle1);
						//	System.out.println(temp);
							
							int test1 = Integer.parseInt(temp);
							
							if (test1 <= max && test1 >= min && test1 != sameTest)
							{
							//	System.out.println(test1);
							//	System.out.println("( "+thisOne+","+test1+")");
								count++;
							}
			
					}
					
				}
				count = count/2;
				System.out.println("Case #"+(test+1)+": "+count);
			}

	}
	

}