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


public class problem3
{
    private final Scanner sc;
    private static final boolean debug = true;

    static void debug(Object ... objects)
    {
        if(debug)
            System.err.println(Arrays.toString(objects));        
    }

    problem3()
    {
        sc = new Scanner(new BufferedInputStream(System.in));
    }

    public static void main(String [] args)
    {
        (new problem3()).solve();
    }

    int AA,BB;

    int rot(int b)
    {
        int p=10;
        int cnt=0;
        int maxP = 1;
        int ans = 0;
        while(b/maxP > 0) maxP*=10;
        while(b/p>0)
        {
            int c = b/p + (maxP/p)*(b%p);
            //System.out.println(b+ " " + maxP+" " + c);
            if(c==b) break;
            if(c>b&&c<=BB&&c>=AA) ans++;
            p*=10;
        }
        return ans;
    }
    
    
    void solve()
    {
        int T = sc.nextInt();
        int cs = 0;
        while(cs < T)
        {
            cs++;
            long ans = 0;
            int A = sc.nextInt(), B = sc.nextInt();
            AA=A;BB=B;

            for(int i=A;i<=B;i++)
            {
                ans+=rot(i);
            }

            System.out.println("Case #" + cs+ ": "+ans);
        }

    }
}
