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.*;

public class RecycledNumbers {

	public RecycledNumbers() {}

	public Integer count(String num, int A, int B) {
		int count = 0;	
		Integer numS = new Integer(num);		
		for (int i = 1; i < num.length(); i++) {			
			Integer newNum = new Integer(num.substring(i) + num.substring(0, i));
			if (newNum <= B && newNum > A && newNum > numS) { 
				count++; 
				//System.out.println("(" + numS + ", " + newNum + ")"); 
			}			
		}
		return count;
	}
	
	public static void main(String[] args) {
		RecycledNumbers rn = new RecycledNumbers();
		try {
			BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
			String line;
			Integer T; int cn = 0;
			while ((line = in.readLine()) != null) {				
				if (cn == 0) {
					T = new Integer(line);
					cn++;
				} else {
					int count = 0;
					String[] AB = line.split(" ");
					int A = new Integer(AB[0]);
					int B = new Integer(AB[1]);
					for (int n = A; n < B; n++) {
						count += rn.count(Integer.toString(n), A, B);
					}					
					System.out.println("Case #" + cn + ": " + count);
					cn++;
				}
			}		
		} catch (Exception e) {}
		
	}
}
