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 com.codejam;

import java.io.File;
import java.io.FileNotFoundException;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class ProblemC {

    public static void main(String[] args) throws FileNotFoundException {

        Scanner sc = new Scanner(new File("C-small-attempt0.in"));
        int T = sc.nextInt();
        sc.nextLine();

        for (int i = 0; i < T; i++) {
            int A = sc.nextInt();
            int B = sc.nextInt();

            System.out.println("Case #" + (i + 1) + ": " + solve(A, B));
        }

    }

    private static long solve(int a, int b) {

        if (a < 10) {
            return 0L;
        }

        long count = 0L;
        int len = (int) Math.floor((Math.log10((double) a)));

        int factor = 1;
        for (int i = 0; i < len; i++) {
            factor *= 10;
        }

        boolean[] mark = new boolean[b - a + 1];

        for (int n = a; n <= b; n++) {

            if (mark[n - a]) {
                continue;
            }

            int nn = n;

            Set<Integer> pairs = new HashSet<Integer>();
            pairs.add(nn);
            mark[nn - a] = true;
            for (int i = 0; i < len; i++) {
                nn = (nn % 10) * factor + nn / 10;
                if (nn >= a && nn <= b) {
                    pairs.add(nn);
                    mark[nn - a] = true;
                }
            }

            count += cn2(pairs.size());
        }

        return count;
    }

    private static long cn2(int size) {
        long s = (long) size;
        return s * (s - 1) / 2L;
    }

}
