import java.io.*;
import java.util.*;

class B
{
	public static void main(String[] args) 
	{
		try
		{
			BufferedReader br = new BufferedReader(new FileReader("B.in"));
			PrintWriter pw = new PrintWriter(new FileWriter("B.out"));
			int X = Integer.parseInt(br.readLine());

			for(int i=0; i<X; i++)
			{
				String[] S = br.readLine().split(" ");
				int A = Integer.parseInt(S[0]);
				int B = Integer.parseInt(S[1]);
				int R = 0;

				int x = 1;
				int n = 0;
				while(A/x > 0) {
					n++;
					x *= 10;
				}

				for(int j=A; j<B; j++) {
					Set<Integer> seen = new HashSet<Integer>();
					for(int k=1; k<n; k++) {
						int p1 = j % (int)Math.pow(10, k);
						int p2 = (int) Math.pow(10, n-k);
						int p3 = j / (int)Math.pow(10, k);
						int y = p1*p2 + p3;
						
						if(j < y && !seen.contains(y) && y <= B) {
							seen.add(y);
							R++;
						}
					}
				}

				pw.printf("Case #%d: %d\n", i+1, R);
				pw.flush();
			}
		}
		catch(Exception e)
		{ 
			e.printStackTrace();
		}
	}
}

import java.util.Scanner;

public class RecycleNum {
	static int digit(int x){
		int d = 0;
		while( x>0 ){
			d++;
			x /= 10;
		}
		return d;
	}
	static int power(int x){
		int n = 1;
		while(x>0){
			n *= 10;
			x--;
		}
		return n;
	}
	static int cirNum(int n, int m){
		int d = digit(n);
		n = (n%power(d-m))*power(m) + (n/power(d-m));
		return n;
	}
	static int result(int A, int B){
		int d = digit(A);
		int count = 0;
		for(int i = A; i <= B; i++){
			int[] key = new int[d-1];
			for(int j = 1; j < d; j++){
				key[j-1] = cirNum(i, j);
				for(int k = 0; k < j-1; k++){
					if( key[j-1] == key[k] ){
						if( key[j-1] != i && key[j-1] >= A && key[j-1] <= B )
							count--;
					}
						
				}
				if( key[j-1] != i && key[j-1] >= A && key[j-1] <= B ){
					count++;		
				}
			}
		}
		return count/2;
		
	}
	
	public static void main(String[] args){
		Scanner stdIn = new Scanner(System.in);
		int T = stdIn.nextInt();  // the number of test cases
		String[] str = new String[T+1];
		String[][] data = new String[T][2];
		for(int i = 0; i < T+1; i++){
			str[i] = stdIn.nextLine();
		}
		for(int i = 0; i < T; i++){
			data[i] = str[i+1].split(" ", 2);
		}
		
		int[] A = new int[T];
		int[] B = new int[T];
		for(int i = 0; i < T; i++){
			A[i] = Integer.parseInt(data[i][0]);
			B[i] = Integer.parseInt(data[i][1]);
		}
		
		for(int i = 0; i < T; i++){
			System.out.println("Case #" + (i+1) + ": " + result(A[i], B[i]));
		}
	}

}
