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

import static java.lang.Math.*;
public class ProC {

	/**
	 * @param args
	 * @throws FileNotFoundException 
	 */
	public static void main(String[] args) throws FileNotFoundException {
		// TODO Auto-generated method stub
		File file = new File("A-small-practice.in");
		Scanner scr = new Scanner(file);
		int i= scr.nextInt();
		int count =0;
		for (int a =1; a<= i; a++) {
			int j =scr.nextInt();
			int k =scr.nextInt();
			for (int b=j; b<=k;b++){
				for (int c =1; c<log(b)/log(10)+1; c++) {
					int last = (int) ((int)b%(Math.pow(10, c)));
					int rest = (int) ((int)b/Math.pow(10, c));
					
					int temp = (int)(log(b)/log(10)+1-c); 
					int temp2 =(int)Math.pow(10, temp);
					int num =  last*temp2 +rest;
					if (num<=k&&num>b){
						count ++;
//						System.out.println(b+" "+num);
					}
					
					
				}
				
			}
			System.out.println("Case #" +a+": "+count);
			count=0;
		}
	}

}
