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;
	}
}

package codeJam;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;


public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		ArrayList<String> numeros= new ArrayList();
		StringBuffer num, copia;
		String aux;
		int test= sc.nextInt(), min, max, largo, cuenta;
		for (int i=1; i<=test; i++){
			numeros.clear();
			cuenta= 0;
			System.out.print("Case #"+i+": ");
			min= sc.nextInt();
			max= sc.nextInt();
			for (int j=min; j<=max; j++){	
				num= new StringBuffer(Integer.toString(j));
				largo= num.length();
				for (int k= 1; k<largo; k++){
					copia= new StringBuffer("");
					copia.append(num.substring(k));
					copia.append(num.subSequence(0, k));
					aux= copia.toString();
					if ((Integer.parseInt(aux) <= max) && (Integer.parseInt(aux) >= min) && (Integer.parseInt(aux) != j) && (!numeros.contains(aux+ ","+ Integer.toString(j)))){
						numeros.add(aux+ ","+ Integer.toString(j));
						numeros.add(Integer.toString(j)+ ","+ aux);
						cuenta++;
					}
				
				}
			}
			System.out.println(cuenta);
		}
	}
}