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.*;
import java.io.*;

public class C {
	public static void main(String[] args) throws Exception {
		String inputfilename = args[0];
		String outputfilename = args[1];
		BufferedReader br = new BufferedReader(new FileReader(inputfilename));
		BufferedWriter bw = new BufferedWriter(new FileWriter(outputfilename));
		int cases = Integer.valueOf(br.readLine());
		for(int i = 0; i < cases; i++) {
			String[] ele = br.readLine().split(" ");
			int A = Integer.valueOf(ele[0]);
			int B = Integer.valueOf(ele[1]);
			int result = C.solve(A,B);
			bw.write("Case #" + (i + 1) + ": " + result + "\n");
		}
		br.close();
		bw.close();
	}
	
	public static int solve(int A,int B) {
		int cnt = 0;
		//System.out.println("\nDoing " + A + " " + B);
		String Astr = String.valueOf(A);
		String Bstr = String.valueOf(B);
		for(int cur = A; cur <= B; cur++) {
			String cstr = String.valueOf(cur);
			//System.out.println("\n" + cstr + "\n");
			Set<String> tset = new HashSet<String>();
			for(int i = 1; i < cstr.length(); i++)
			{
				String tmp = cstr.substring(i) + cstr.substring(0,i);
				//System.out.println(" " + tmp);
				if(tmp.compareTo(cstr) > 0 && tmp.compareTo(Bstr) <= 0 && !tset.contains(tmp)) {
					cnt++;
					tset.add(tmp);
					//System.out.print(" " + cstr + "!!" +tmp);
				}
			}
		}
		return cnt;
	}
}