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 RecycledNumbers {
	
	public static int countRecycledNumbers(int a,int b){
		int count=0;
		int t[][] = new int[(b-a)+1][(b-a)+1];
		for(int i=0; i<(b-a)+1; i++){
			for(int j=0; j<(b-a)+1; j++){
				t[i][j]=0;
			}
		}
		int max = String.valueOf(a).length();
		for(int j=a; j<=b; j++){
			int n = j;	
			for(int i=1; i<max; i++){
				int m = Integer.parseInt(String.valueOf(n).substring(max-i)+String.valueOf(n).substring(0,max-i));
				if(a<=n && n<m && m<=b){
					if(t[n-a][m-a]==0){
						t[n-a][m-a]=1;
						count++;
					}
				}
			}
		}
		return count;
	}
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int i = 0; i < T; i++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			int count = countRecycledNumbers(A,B);
			System.out.println("Case #" + (i + 1) + ": "+count );
		}
	}
}
