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 ProblemC {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int t = in.nextInt();
		int a = 0, b = 0, count;
		String a_str = "";
		ArrayList<String> ar = new ArrayList<String>();
		for (int i = 0; i < t; i++) {
			ar.clear();
			count = 0;
			a = in.nextInt();
			b = in.nextInt();
			a_str = Integer.toString(a);
			int a_length = a_str.length();
			if (a_length > 1) {
				for (int j = a; j < b; j++) {
					for (int k = j + 1; k <= b; k++) {
						a_str = Integer.toString(j);
						//b_str = Integer.toString(k);
						for (int h = 0; h < a_length - 1; h++) {
							a_str = a_str.charAt(a_length - 1) + a_str.substring(0, a_length - 1);
							if (Integer.parseInt(a_str) == k && !ar.contains(j + ", " + k)) {
								count++;
								ar.add(j + ", " + k);
								//System.out.println(j + ", " + k);
							}
						}
					}
				}
				System.out.println("Case #" + (i + 1) + ": " + count);
			} else {
				System.out.println("Case #" + (i + 1) + ": 0");
			}
		}
	}
}
