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

public class RCTest{

	public static void main(String[] args){
	
		Scanner scan = new Scanner(System.in);
		int numberOfCases = Integer.parseInt(scan.nextLine());
		for(int i = 1; i <= numberOfCases; ++i){
			String line = scan.nextLine();
			String[] inputs = line.split(" ");
			int lower = Integer.parseInt(inputs[0]);
			int upper = Integer.parseInt(inputs[1]);
			RCTest r = new RCTest();
			System.out.println("Case #" + i + ": " + r.getRecycleNumbers(lower, upper));
		}
	}
	
	public int getRecycleNumbers(int a, int b){
		this.lower = a;
		this.upper = b;
		int counter = 0;
		for(int i = a; i<=b; ++i){
			int originalNumber = i;
			int index = getIndex(originalNumber);
			int recycledNumber = getRecycledNumber(i,index);
			
			while(originalNumber!=recycledNumber){
			
				if(originalNumber < recycledNumber && recycledNumber <= upper)++counter;
				recycledNumber = getRecycledNumber(recycledNumber,index);
			}
			
		}
		return counter;
	}
	public int getRecycledNumber(int number, int index){
		int remainder = number % 10;
		int quotient = number/10;
		int recycledNumber = ((int)Math.pow(10,index) * remainder) +  quotient;
		return recycledNumber;
	}	
	
	private int getIndex(int number){
		int index = 0;
		while(number!=0){
			number/=10;
			++index;
		}
		return index-1;
	}
	private int lower;
	private int upper;
}