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

public class Test {
	public static void main(String[] args) {
		Scanner sin = new Scanner(System.in);
		int cases, a, b;
		int[] ans;

		cases = sin.nextInt();
		ans = new int[cases];
		for (int i = 0; i < cases; i++) {
			int count = 0;

			a = sin.nextInt();
			b = sin.nextInt();

			for (int j = a; j <= b; j++) {
				String ori = String.valueOf(j);
				int[] temp = new int[ori.length() - 1];
				int tempIndex = 0;

				for (int k = 1; k < ori.length(); k++) {
					String newStr = ori.substring(k, ori.length())
							+ ori.substring(0, k);
					int newInt;
					boolean skip = false;

					if (newStr.charAt(0) == '0')
						continue;

					newInt = Integer.parseInt(newStr);

					for (int m = 0; m < tempIndex; m++)
						if (temp[m] == newInt) {
							skip = true;
							break;
						}

					if (skip == false)
						temp[tempIndex++] = newInt;
					else
						continue;

					if (j < newInt && newInt >= a && newInt <= b)
						count++;
				}
			}
			ans[i] = count;
		}

		for (int i = 0; i < cases; i++)
			System.out.println("Case #" + (i + 1) + ": " + ans[i]);
	}
}