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 Main
{
    public static void main(String[] args)
    {
        Scanner cin = new Scanner (System.in);
        int cas = cin.nextInt();
        for(int ii = 1; ii <= cas; ii++)
        {
            System.out.printf("Case #%d: ",ii);
            int a = cin.nextInt();
            int b = cin.nextInt();
            String tmp = String.valueOf(a);
            int len = tmp.length();
            int ten = 1;
            for(int i = 0; i < len; i ++)
                ten *= 10;
            int ret = 0;
            boolean[] hasused = new boolean[ten];
            for(int i = a; i < b; i++)
            {
                int cnt = 0;
                if(hasused[i] == true) continue;
                hasused[i] = true;
                String si = String.valueOf(i);
                for(int j = 0; j < len; j++)
                {
                    for(int k = j; k < len; k++)
                    {
                        String rear = si.substring(j,k);
                        String front = si.substring(k,len);
                        int ans = Integer.parseInt(front+rear);
                        //System.out.println(ans);
                        if(ans == i) continue;
                        if(hasused[ans] == false && ans <= b && ans >= a)
                        {
                            cnt++;
                            hasused[ans] = true;
                            //System.out.printf("%d,%d\n",i,ans);
                        }
                    }
                }
                ret += cnt * (cnt + 1) /2;
            }
            System.out.println(ret);
        }
    }
}
