import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;


public class Main {

//	static int MAX = 10000;
	static int MAX = 2000000;
	static Object[] All = new Object[MAX+1];
	
	static int size( int x ) {
		if(x>999999) return 7;
		if(x>99999)  return 6;
		if(x>9999)   return 5;
		if(x>999)    return 4;
		if(x>99)     return 3;
		if(x>9)      return 2;
		return 1;
	}
	static int[] rotate( int value ) {
		List<Integer> result = new ArrayList<Integer>();
		int[] V = new int[8];
		int s = size(value);
		int x = value;
		
		for(int i=s-1;i>=0;i--) {
			V[i] = x%10;
			x /=10;
		}
		int rot;
		for(int i=1; i<s; i++) {
			if(V[i]!=0){
				rot=0;
				for(int j=0,ii=i;j<s; j++,ii=(ii+1)%s){
					rot=rot*10+V[ii];
				}
				if(rot>value && !result.contains(rot))
					result.add(rot);
			}
		}
		if( result.isEmpty() )
			return null;
		int[] r = new int[result.size()];
		for(int i=0; i<r.length; i++)
			r[i]=result.get(i);
		return r;
	}
	
	static void precalculate() {
		for(int i=1; i<=MAX; i++){
			All[i] = rotate(i);
		}
	}
	static int solve( Scanner in ) {
		int A, B, sol=0;
		
		A = in.nextInt();
		B = in.nextInt();

		for( int i=A; i<=B; i++) {
//			List<Integer> result = rotate(i);
			if( All[i]!=null ) {
				for(int value: (int[])All[i] ) {
					if( value <= B )
						sol++;
				}
			}
		}

		return sol;
	}
	
	public static void main ( String args[] ) {
		int T; 
		Scanner in = new Scanner(System.in);
		T = in.nextInt();
		int cnt=0;
		int sol;
		precalculate();
		for( cnt=1; cnt<=T; cnt++ ) {
			sol = solve( in );
			System.out.printf("Case #%d: %d\n", cnt, sol);
		}

	}
}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;


public class RecycledNumbers {

	/**
	 * @param args
	 * @throws IOException 
	 * @throws NumberFormatException 
	 */
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int cases = Integer.parseInt(br.readLine().trim());
		for(int t=1;t<=cases;t++){
			String[] inp=br.readLine().trim().split(" ");
			int start=Integer.parseInt(inp[0]);
			int end=Integer.parseInt(inp[1]);
			System.out.println("Case #"+t+": "+getAns(start, end));
		}
	}
	
	public static long getAns(int start, int end){
		boolean[] visited=new boolean[end+1];
		long total=0;
		int max=0;
		
		int digitCount=1;
		int mult=10;
		while(start/(mult) !=0){
			digitCount++;
			mult*=10;
		}
		for(int n=start;n<=end;n++){

			int count=1;
			if(visited[n])
				continue;
			
			visited[n]=true;
			for(int s=1;s<digitCount;s++){
				int o=n;
				int fst=(int) Math.pow(10, s), oth=(int) Math.pow(10, digitCount-s);
				int rem=o%fst;
				o/=fst;
				o+=(rem*oth);
				if(o>=start && o<=end && !visited[o]){
					if(rem/(Math.pow(10,digitCount-s-1))>0){
						if(o!=n){
							count++;
							visited[o]=true;
						}
					}
				}
			}
			total+=count*(count-1)/2;
			
		}
		return total;
	}

}
