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.ArrayList;
import java.util.Scanner;

public class Solution {
	public static void main(String[] args){
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		in.nextLine();
		int A, B, result,len,i,j,k;
		String that,original;
		String test="";
		ArrayList<String> poss = new ArrayList<String>();
		for(int zz = 1; zz <= T;zz++){
			result=0;
			A = in.nextInt();
			len = String.valueOf(A).length();
			poss = new ArrayList<String>();
			B = in.nextInt();
			in.nextLine();
			for (i = A; i <= B; i++){
				poss.add(String.valueOf(i));
			}
			for (i = 0; poss.size() > 0; i++){
				that = poss.get(0);
				poss.remove(0);
				original=that;
				for (k=0; k < len; k++){
					test=test+that.charAt(len-1);
					for (j=0; j < (len-1); j++){
						test=test+that.charAt(j);
					}
					if (that.charAt(len-1) != '0' && poss.contains(test)){
						result++;
						//System.out.format("(%s,%s)\n",original,test);
					}
					that=test;
					test="";
				}
			}
			System.out.format("Case #%d: %d\n",zz, result);
		}
	}
}
