import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

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);
      }
   }
}
