import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;


public class Main {

//	static int MAX = 10000;
	static int MAX = 2000000;
	static Object[] All = new Object[MAX+1];
	
	static int size( int x ) {
		if(x>999999) return 7;
		if(x>99999)  return 6;
		if(x>9999)   return 5;
		if(x>999)    return 4;
		if(x>99)     return 3;
		if(x>9)      return 2;
		return 1;
	}
	static int[] rotate( int value ) {
		List<Integer> result = new ArrayList<Integer>();
		int[] V = new int[8];
		int s = size(value);
		int x = value;
		
		for(int i=s-1;i>=0;i--) {
			V[i] = x%10;
			x /=10;
		}
		int rot;
		for(int i=1; i<s; i++) {
			if(V[i]!=0){
				rot=0;
				for(int j=0,ii=i;j<s; j++,ii=(ii+1)%s){
					rot=rot*10+V[ii];
				}
				if(rot>value && !result.contains(rot))
					result.add(rot);
			}
		}
		if( result.isEmpty() )
			return null;
		int[] r = new int[result.size()];
		for(int i=0; i<r.length; i++)
			r[i]=result.get(i);
		return r;
	}
	
	static void precalculate() {
		for(int i=1; i<=MAX; i++){
			All[i] = rotate(i);
		}
	}
	static int solve( Scanner in ) {
		int A, B, sol=0;
		
		A = in.nextInt();
		B = in.nextInt();

		for( int i=A; i<=B; i++) {
//			List<Integer> result = rotate(i);
			if( All[i]!=null ) {
				for(int value: (int[])All[i] ) {
					if( value <= B )
						sol++;
				}
			}
		}

		return sol;
	}
	
	public static void main ( String args[] ) {
		int T; 
		Scanner in = new Scanner(System.in);
		T = in.nextInt();
		int cnt=0;
		int sol;
		precalculate();
		for( cnt=1; cnt<=T; cnt++ ) {
			sol = solve( in );
			System.out.printf("Case #%d: %d\n", cnt, sol);
		}

	}
}


import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.StringTokenizer;

public class Recycle
{

    static String shiftRight( String s )
    {
        String res = "" +  s.charAt( s.length() - 1 );
        res = res + s.substring( 0, s.length()-1 );

        return res;
    }

    static int solve( int a, int b )
    {
        HashSet<String> h = new HashSet();
        int res = 0;

        for( int i=a; i<=b; i++ )
        {
            String curr = Integer.toString(i);
            if( h.contains( curr ) )
                continue;

            // else compute number of shifts
            HashSet<String> temp = new HashSet();
            String s = curr;
            temp.add( curr );
            h.add( curr);

            for( int j=0; j<curr.length()-1; j++ )
            {
                s = shiftRight( s );

                // check for leading zeroes

                if( s.charAt(0) == '0')
                    continue;

                // check if valid range
                int x = Integer.parseInt( s );

                if( ( x>=a ) && (  x<=b ))
                {
                    temp.add(s);
                    h.add( s );
                }
            }

            // now count how many such pairs ( n choose 2 = n( n-1 )/2 )

            int k = temp.size();
            res += k*( k-1 )/2;

        }

        return res;

    }

    public static void main( String[] args ) throws IOException
    {
        FileWriter fr= new FileWriter("/home/gowri/Desktop/out.txt");
        BufferedWriter out = new BufferedWriter( fr );
        BufferedReader br = new BufferedReader( new InputStreamReader( System.in ));
        int t = Integer.parseInt( br.readLine() );
        StringTokenizer tok;

        for( int i=0; i<t; i++ )
        {
            String s = br.readLine();
            tok = new StringTokenizer( s );
            
            int A = Integer.parseInt( tok.nextToken() );
            int B = Integer.parseInt( tok.nextToken() );

            String res = String.format( "Case #%d: ", i+1 );
            out.write( res );
            out.write( Integer.toString(solve( A, B ) ));
            out.newLine();
        }

        out.close();


    }
}
