import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

/* ==========================================================
 *  (C) Copyright 2007-present Facebook. All rights reserved.
 * ==========================================================
 */


import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;

/**
 * .
 *
 * @author
 */
public class Recycle {
    public static void main( String[] args ) throws NumberFormatException,
        IOException {
        final BufferedReader in =
            new BufferedReader( new FileReader(
                    "/Users/oded/a/ttt/src/in.txt" ) );
        final int numLines = Integer.parseInt( in.readLine() );

        for( int i = 0; i < numLines; i++ ) {
            handleLine( in.readLine(), i );
        }
    }

    private static int countDigits( int a ) {
        int count = 0;

        while( a > 0 ) {
            count++;
            a = a / 10;
        }

        return count;
    }

    private static void handleLine( String readLine, int i ) {
        String[] numbers = readLine.split( " " );
        int      a       = Integer.parseInt( numbers[ 0 ] );
        int      b       = Integer.parseInt( numbers[ 1 ] );
        int      count   = 0;
        int      digits  = countDigits( a );

        if( digits > 1 ) {
            int den = 1;

            while( digits > 1 ) {
                den *= 10;
                digits--;
            }

            for( int n = a; n < b; n++ ) {
                int perm = shift( n, den );

                while( perm != n ) {
                    if( perm > n && perm <= b ) {
                        count++;
                    }

                    perm = shift( perm, den );
                }
            }
        }

        System.out.println( "Case #" + ( i + 1 ) + ": " + count );
    }

    private static int shift( int n, int den ) {
        return ( n / den ) + ( n % den ) * 10;
    }
}
