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.FileNotFoundException;
import java.util.Scanner;


public class Recycling {
	public static void main(String[] args) throws FileNotFoundException {
		File file = new File("C-small-attempt0.in");
		Scanner in = new Scanner(file);
		
		int cases = in.nextInt();
		
		for (int i = 0; i < cases; i++) {
			int A = in.nextInt();
			int B = in.nextInt();
			int pairs = 0;
			while (A < B) {
				String perm = A+"";
				for (int j = 1; j < perm.length(); j++) {
					String x = perm.substring(0,j);
					String y = perm.substring(j,perm.length());
					String out = y+x;
					int testCase = Integer.parseInt(out);
					if (A < testCase && testCase <= B ) {
						pairs++;
						
					}
				}
				
				A++;
			}
			
			
			System.out.println("Case #"+ (i+1) + ": " + pairs);
		}
		
	}
}
