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.File;
import java.io.FileNotFoundException;
import java.util.Scanner;


public class C {
    public static void main (String [] args) throws FileNotFoundException {
        Scanner input = new Scanner(new File("csmall.in"));
        int count = input.nextInt();
        for (int i = 0; i < count; i++) {
            int A = input.nextInt();
            int B = input.nextInt();
            System.out.println("Case #" + (i+1) + ": " + doWork(A, B));
        }
    }
    
    private static int doWork(int a, int b) {
        int count = 0;
        int n = a;
        int m = a + 1;
        while (m <= b) {
            n = a;
            while (n < m) {
                if (checkRotation(Integer.toString(n), Integer.toString(m)))
                    count++;             
                n++;
            }
            m++;
        }
        return count;
    }

    private static boolean checkRotation(String given, String toCheck) {
        char [] giv = given.toCharArray();
        char [] temp = new char[giv.length + 1];
        int i , j , n;
        n = temp.length - 1;
        for (i = 0; i < giv.length; i++) {
            temp[i] = giv[i];
        }
        for(i = 0; i < given.length(); i++)
        {
            temp[n] = temp[0];

            for(j = 0; j < n; j++)
            {
                temp[j] = temp[j+1];
            }
            char[] moreTemp = new char[giv.length];
            for (int k = 0; k < giv.length; k++) {
                moreTemp[k] = temp[k];
            }
            if ((new String(moreTemp)).equals(toCheck)) {
                return true;
            }
            //System.out.printf("\n %s", new String(moreTemp));
        }
        return false;
    }
}
