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.HashSet;
import java.util.Hashtable;
import java.util.Scanner;
import java.util.Set;


public class CodeJamC {
	
	
	public static void main(String args[]){
		Scanner scn = new Scanner(System.in);
		int t = scn.nextInt();
		int a;
		int b;
		int m;
		int n;
		String stra;
		String str;
		for(int i = 1; i <= t; i++){
			a = scn.nextInt();
			b = scn.nextInt();
			Set<String> set = new HashSet<String>();
			
			for(int j = a; j <= b; j++){
				
				stra = j+"";
				str = stra;
				for(int k = 1; k < stra.length();k++){
					str = str.charAt(str.length()-1) + str.substring(0,str.length()-1);
					n = Integer.parseInt(str);
					
					if(n <= a)
						continue;
					if(n<=j)
						continue;
					if(n>b)
						continue;
					
					if(j<n){
						set.add(j+""+n+"");
					}else{
						set.add(n+""+j+"");
					}
				}
			}
			
			System.out.println("Case #"+i+": "+set.size());
		}
	}
}
