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;
	}
}

package qualification_2012;

import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Scanner;

public class PC {
	static Scanner sc = new Scanner(System.in);
	static PrintWriter pw = new PrintWriter(System.out);

	public static void main(String[] args) {
		int n = sc.nextInt();
		for (int i = 1; i <= n; i++) {
			int a = sc.nextInt();
			int b = sc.nextInt();
			pw.println("Case #" + i + ": " + calculate(a, b));
		}
		pw.flush();
	}

	static long calculate(int a, int b) {
		long result = 0;

		for (int j = a; j < b; j++) {
			result += count(j, b);
		}
		return result;
	}

	static int count(int n, int max) {
		String str = n + "";
		int m = str.length();
		int result = 0;
		ArrayList<Integer> store = new ArrayList<Integer>();
		for (int i = 1; i < m; i++) {
			int b1 = (int) Math.pow(10, i);
			int b2 = (int) Math.pow(10, m - i);
			int x = (n % b1) * b2 + n / b1;
			if (x > n && x <= max && !store.contains(x)) {
				store.add(x);
				result++;
			}
		}

//		if (result > 0)
//			pw.println(n + " " + result);
		return result;
	}
}
