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.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;
import java.util.TreeSet;


public class CJ_2012_Q_C {
	
	public static void main(String[] args) throws IOException {
		Scanner in = new Scanner(new File("cj_files/in"));
		FileWriter w = new FileWriter(new File("cj_files/out"));
		
		int cases = in.nextInt();
		int a, b, numDigits, count, newNum;
		String oStr, nStr;
		TreeSet<Integer> numbers = new TreeSet<Integer>();
		
		for(int i = 1; i <= cases; i++) {
			a = in.nextInt();
			b = in.nextInt();
			numDigits = (a + "").length();
			count = 0;
			for(int j = a; j < b; j++) {
				oStr = j + "";
				numbers.clear();
				for(int k = 1; k < numDigits; k++) {
					nStr = oStr.substring(numDigits - k) + oStr.substring(0, numDigits - k);
					newNum = Integer.parseInt(nStr);
					if(newNum > j && newNum <= b) {
						numbers.add(newNum);
					}
				}
				count += numbers.size();
			}
			
			w.write(String.format("Case #%d: %d\n", i, count));
		}
		
		w.close();
	}
}
