package qual;

import java.util.Scanner;

public class RecycledNumbers {

	public static void main(String[] args) {
		new RecycledNumbers().run();

	}

	private void run() {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int t = 0; t < T; t++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			int result = solve(A, B);
			System.out.printf("Case #%d: %d\n", t + 1, result);
		}
	}

	public int solve(int A, int B) {
		int result = 0;
		for (int i = A; i <= B; i++) {
			int dig = (int) Math.log10(A/*same as B*/) + 1;
			int aa = i;
			for (int d = 0; d < dig - 1; d++) {
				aa = (aa % 10) * (int)Math.pow(10, dig - 1) + (aa / 10);
				if (i == aa) {
					break;
				}
				if (i < aa && aa <= B) {
//					System.out.printf("(%d, %d) ", i, aa);
					result++;
				}
			}
		}
		return result;
	}

}

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

}
