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.*;

public class Main
{

  public static void main(String[] args)
  {
    Scanner in = new Scanner(System.in);
    Integer numCases = Integer.parseInt(in.nextLine());
    
    for (int k = 0; k < numCases; k++)
    {
      Integer num1 = Integer.parseInt(in.next());
      int num2 = Integer.parseInt(in.next());
      int count = 0;
      //ArrayList<Integer> tested = new ArrayList<Integer>();
      
      for (Integer i = num1; i <= num2; i++)
      {
	String number = i.toString();
	for (int j = 1; j < number.length(); j++)
	{
	  
	    String front = number.substring(j);
	    String newNumber = front + number.substring(0, j);
	    
	    Integer result = Integer.parseInt(newNumber);
	    
	    if (result > i && result <= num2)
	    {
	      /*tested.add(result);
	      tested.add(i);
	      System.out.println(result);*/
	      count++; 
	    }
	}
	//tested.add(i);
      }
      System.out.println("Case #"+(k+1)+": "+count);
    }
  }

}