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.BufferedReader;
import java.io.FileReader;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;



public class RecycleNumbers {
	public static void main(String[] args) {
		try{
			BufferedReader fileIn = new BufferedReader(new FileReader("C-small-attempt0.in"));
			int cases = Integer.valueOf(fileIn.readLine());
			Scanner numReader = new Scanner(fileIn);
			for(int i = 0; i < cases; i++) {
				int start = numReader.nextInt();
				int end = numReader.nextInt();
				List<NumberQueue.Pair> p = new ArrayList<NumberQueue.Pair>();
				for(int n = start; n <= end; n++) {
					NumberQueue q = new NumberQueue(n);
					List<NumberQueue.Pair> returned = q.distinctRoations(start, end);
					for(NumberQueue.Pair ap : returned) {
						if(!p.contains(ap)) {
							p.add(ap);
						}
					}
				}
				System.out.println("Case #"+(i+1)+": "+p.size());
			}
		} catch(Exception err) {
			System.out.println("ERRORRRRRRRRRRRRRRRRRRRRR: "+ err.getMessage());
			err.printStackTrace();
		}
	}
}
