package codejam;

import java.util.*;
import java.io.*;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

// Skeleton program used for reading and outputing the results
// Part3 program

import java.util.*;

public class part3
{


  public static void main(String args[])
  {
    Scanner scanner = new Scanner(System.in);

    int number = scanner.nextInt();
    
    for (int i = 0; i < number; i++)
    {
      doMagic(scanner.nextInt(), scanner.nextInt(), i + 1);
    }
  }

  private static void doMagic(int lower, int upper, int caseNumber)
  {
    if (lower >= 10)
    {
      int count = 0;
      for (int number = lower; number <= upper; number++)
      {
	for (int i = number + 1; i <= upper; i++)
        {
          String numberString = Integer.toString(number);
	  String iString = Integer.toString(i);

	  boolean found = false;
	  for (int shift = 1; shift < iString.length() && !found; shift++)
	  {
	    String shiftedString = iString.substring(shift)
	                           + iString.substring(0, shift);
	    
	    if (numberString.equals(shiftedString))
	    {
	      count++;
	      found = true;
	    }
	  }
        }
      }

      System.out.println("Case #" + caseNumber + ": " + count);
    }
    else
    {
      System.out.println("Case #" + caseNumber + ": 0");
    }
  }

}
