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


public class PairList{

	public ArrayList<Pair> pairs;

	public PairList(){
		pairs= new ArrayList();
	}
	
	public void addP(int i, Pair pair){
		pairs.add(i,pair);
	}
	
	public int Find (Pair pair,int big){
		int ena=pair.first;
		int dyo=pair.second;
		int length=pairs.size();
		Pair temp;
		int ret=0;
		int k=0;
		if(length==0){
			ret=0;
		}
		else{
			for(k =0; k<length; k++){
				temp=pairs.get(k);
				if (temp.first==pair.first){
					if(temp.second==pair.second)
					ret=big+2;
				}
				else if(temp.first>pair.first){
					ret=k;			
				}
			}
			if(k==length-1)
				ret=k+1;
		}
		return(ret);
	}
}
