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.*;

public class Main{
    public static void main(String[] args){
	Scanner sc = new Scanner(System.in);

	int T = sc.nextInt();
	int caseNum = 0;

	while(caseNum++<T){

	    int A = sc.nextInt();
	    int B = sc.nextInt();

	    int ans = 0;
	    for(int i=A; i<B; i++){
		for(int j=i+1; j<=B; j++){
		    String n = Integer.toString(i);
		    String m = Integer.toString(j);
		    int nlen = n.length();
		    for(int k=0; k<nlen; k++){
			n = n.substring(nlen-1,nlen)+n.substring(0,nlen-1);
			if(n.equals(m)){
			    ans++; break;
			}
		    }
		}
	    }

	    System.out.println("Case #"+caseNum+": "+ans);
	}
    }
}