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.io.BufferedReader;
import java.io.InputStreamReader;
public class Recycled{
public static void main(String[] args) throws java.io.IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int t = Integer.parseInt(br.readLine());
for(int i=0;i<t;i++){
String[] input = br.readLine().split(" ");
int n = Integer.parseInt(input[0]);
int m = Integer.parseInt(input[1]);
int tm = m;
int tn = n;
int count = 0;
while(tm>n)
{
for(int j=n;j<tm;j++)
{
if(isRecycledPair(j,tm))
count++;
}
tm--;
}
System.out.println("Case #" + (i+1) + ": " + count);
}
}
private static boolean isRecycledPair(int n, int m){
String sn = Integer.toString(n);
String sm = Integer.toString(m);
int len = sn.length();
for(int i=0;i<len-1;i++)
{
sn = sn.charAt(len-1) + sn.substring(0,len-1);
if(sn.equals(sm))
return true;
}
return false;
}
}