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.*;
import java.util.Scanner;
public class Main3 {
	public static void main(String args[]) throws FileNotFoundException
	{
		//String test = "123400";
		//System.out.println(test.substring(2,4));
		Scanner in = new Scanner(new FileReader("input.in"));
		PrintWriter out = new PrintWriter("output.txt");
		int T = 0;
		String S1 = in.nextLine();
		T = Integer.parseInt(S1);
		for(int i=0;i<T;i++)
		{
			int answer = 0;
			S1 = in.nextLine();
			out.print("Case #"+ (i+1) +": ");
			int space = S1.indexOf(" ");
			String a1 = S1.substring(0, space);
			String a2 = S1.substring(space+1, S1.length());
			int A = Integer.parseInt(a1);
			int B = Integer.parseInt(a2);
//			System.out.println(A);
//			System.out.println(B);
			for(int n=A;n<=B;n++)
			{
				String str = String.valueOf(n);
//				System.out.println(str);
				int a[] = {0,0,0,0,0,0,0,0};
				for(int j=0;j<str.length()-1;j++)
				{
					
					if(str.charAt(j+1)!='0')
					{
						//System.out.println("chutiya");
						String str1 = str.substring(j+1).concat(str.substring(0, j+1));
						int m = Integer.parseInt(str1);
						a[j] = m;
//						System.out.println(j+ " " + m + " " + n);
						if (m>n && m<=B)
						{
							int repeat = 0;
							for(int k= 0;k<j;k++)
							{
								if(m == a[k])
									repeat = 1;
							}
							if(repeat == 0)
								answer++;
						}
//						System.out.println("answer = " +answer);
					}
				}
				
			}
			out.print(answer);
			out.println("");
		}
		out.close();
	}

}
