package qual;

import java.util.Scanner;

public class RecycledNumbers {

	public static void main(String[] args) {
		new RecycledNumbers().run();

	}

	private void run() {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int t = 0; t < T; t++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			int result = solve(A, B);
			System.out.printf("Case #%d: %d\n", t + 1, result);
		}
	}

	public int solve(int A, int B) {
		int result = 0;
		for (int i = A; i <= B; i++) {
			int dig = (int) Math.log10(A/*same as B*/) + 1;
			int aa = i;
			for (int d = 0; d < dig - 1; d++) {
				aa = (aa % 10) * (int)Math.pow(10, dig - 1) + (aa / 10);
				if (i == aa) {
					break;
				}
				if (i < aa && aa <= B) {
//					System.out.printf("(%d, %d) ", i, aa);
					result++;
				}
			}
		}
		return result;
	}

}

import java.util.Scanner;

public class NumberRecycling {
	public static void main( String args[] ) {
		new NumberRecycling();
	}
	
	public NumberRecycling() {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		
		for( int j=1; j<=T; j++ ) {
			System.out.println( "Case #"+ j + ": " + doCase(sc) );
		}
	}
	
	public int doCase( Scanner sc ) {
		int A = sc.nextInt();
		int B = sc.nextInt();
		
		int pairs = 0;
		for( int i=A+1; i<=B; i++ )
			pairs += numberOfLowerPairNumbers(A,i);
		
		return pairs;
	}
	
	public int numberOfLowerPairNumbers( int lowerBound, int num ) {
		String number = Integer.toString(num);
		String tmp    = new String(number);
		
		int result = 0;
		
		for( int i=0; i<number.length()-1; i++ ) {
			tmp = tmp.substring(1) + tmp.charAt(0);
			
			if( tmp.charAt(0) == '0' )
				continue;
			
			int shiftedNum = Integer.parseInt(tmp);
			
			if( shiftedNum == num )
				break;
			
			if( shiftedNum < num && shiftedNum >= lowerBound )
				result++;
		}
		
		return result;
	}
}