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.util.ArrayList;
import java.util.Scanner;


public class QuestionC extends Question{

	private int A;
	private int B;
	private int significant;
	private int digits;

	public QuestionC(Result result, Counter counter)
	{
		super(result, counter);
	}

	@Override
	public void readInput(Scanner scanner) {
		A = scanner.nextInt();
		B = scanner.nextInt();
		digits = Integer.toString(A).length();
		significant = (int)Math.pow(10, digits-1);
	}
	
	@Override
	public String solution() {
		int counter = 0;
		ArrayList<Integer> used = new ArrayList<Integer>();
		for (int i = A; i < B; i++) {
			int shifted = i;
			for (int j = 0; j < digits-1; j++) {
				shifted = (shifted%10)*significant+shifted/10;
				if (shifted > i && shifted <= B && !used.contains(shifted)) {
					counter++;
					used.add(shifted);
				}
			}
			used.clear();
		}
		return Integer.toString(counter);
	}


}
