import java.util.Scanner;

class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t=sc.nextInt();
		int casos=1, a, b, n, m, cont;
		while(t!=0){
			a=sc.nextInt();
			b=sc.nextInt();
			if(a>b){
				int aux=a;
				a=b;
				b=aux;
			}
			System.out.printf("Case #%d: ",casos++);
			if(a==b){
				System.out.printf("%d\n",0);
			}else{
				cont=0;
				for(n=a;n<b;n++){					
					for(m=n+1;m<=b;m++){					
						if(isRecycled(n,m)) cont++;
					}
				}
				System.out.printf("%d\n",cont);
			}
			t--;
		}		
	}
	public static boolean isRecycled(int n1, int n2){
		String s1, s2, aux;
		s1 =  String.valueOf( n1 );
		s2 =  String.valueOf( n2 );		
		boolean r = false;		
		for(int i=0;i<s1.length();i++){
			aux="";
			aux=s1.substring(i,s1.length())+s1.substring(0,i);
//			System.out.println(aux);
			if(aux.equals(s2)){
				r=true;
				break;
			}
		}		
		return r;
	}
}

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

public class ProblemC {

    public static int recycles(int a, int min, int max) {
	HashSet<Integer> history = new HashSet<Integer>();
	int count = 0;
	int size = ("" + a).length();
	int power = (int)Math.pow(10, size - 1);
	int value = a;
	history.add(a);
	for (int i = 0; i < size; i++) {
	    int digit = value % 10;
	    int next = value / 10 + digit * power;
	    if (history.contains(next)) {
		break;
	    } else if (digit != 0 && next > a && next >= min && next <= max) {
		count++;
	    }
	    value = next;
	    history.add(next);
	}
	return count;
    }

    public static void main(String[] args) throws Exception {
	Scanner input = new Scanner(System.in);
	int lines = Integer.parseInt(input.nextLine().trim());
	for (int i = 0; i < lines; i++) {
	    String[] tokens = input.nextLine().split(" ");
	    int A = Integer.parseInt(tokens[0].trim());
	    int B = Integer.parseInt(tokens[1].trim());
	    int total = 0;
	    for (int j = A; j <= B; j++) {
		total += recycles(j, A, B);
	    }
	    System.out.println("Case #" + (i+1) + ": " + total);
	}
    }

}