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.io.*;
   import java.util.*;
   
    public class ProblemB {
   
       public static void main(String[] args) throws Exception {
      
         String filename = "C-small-attempt0.in";
         Scanner sc = new Scanner(new File(filename) );
      
         System.setOut(new PrintStream(new FileOutputStream("BSolution.txt")));
         int cases = Integer.parseInt(sc.next());
         sc.nextLine();
         
         for(int l = 1; l <= cases; l++) {
          	  
            int A = sc.nextInt();
            int B = sc.nextInt();
            
            int counter = 0;	
            
            for(int m = B; m > A; m--) {
            
               for(int n = A; n < m; n++) {
               
                  if(isRecycled(n,m))
                     counter++;
               }
            }
         	
            System.out.print("Case #" + l + ": " + counter);
            System.out.println();
         }
      }
       public static boolean isRecycled(int n, int m) {
      
         String str = Integer.toString(n);
      	
         if(Integer.toString(n).length() != Integer.toString(m).length()) 
            return false;
         else {
            for(int k = 1; k < str.length(); k++) {
               String temp = "";
                  
               temp = str.substring(str.length() - k, str.length()) + str.substring(0, str.length() - k);
                 
               if(m == Integer.parseInt(temp))
                  return true;
               
            } 
         }
         return false;
      }
   }