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

/**
 * Created by IntelliJ IDEA.
 * User: Ran
 * Date: Apr 14, 2012
 * Time: 3:46:24 AM
 * To change this template use File | Settings | File Templates.
 */
public class Recycled {

   private static int numDigits;

   private static int mult[] = {
         10, 100, 1000, 10000, 100000, 1000000, 10000000
   };

   private static int shift (int x)  {

      int lastDigit = x % 10;
      x = x / 10;
      x += lastDigit * mult[numDigits-2];

      return x;
   }
   
   private static boolean isPair (int x, int y) {

      for (int i = 0; i < numDigits - 1; i++) {
         x = shift (x);
         if (x == y)
            return true;
      }

      return false;
   }

   public static void main (String[] args) {

      Scanner s = null;
      try {
//         s = new Scanner (new File ("C-small-test.in"));
         s = new Scanner (new File ("C-small-attempt0.in"));
      } catch (FileNotFoundException e) {
         e.printStackTrace ();
      }

      int t = s.nextInt();

      // Traverse all test cases.
      for (int test = 1; test <= t; test++) {

         int a = s.nextInt();
         int b = s.nextInt();
         numDigits = (int)(Math.floor (Math.log10 (a))) + 1;

         int numPairs = 0;

         for (int i = a; i < b; i++)
            for (int j = i + 1; j <= b; j++)
               if (isPair (i, j))
                  numPairs++;

         System.out.println ("Case #" + test + ": " + numPairs);
      }
   }
}
