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

}

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

public class Google2 {
  public static void main(String[] args) throws IOException {
    Scanner kb = new Scanner(new File("c:/A-small-attempt0.in"));
//    Scanner kb = new Scanner(System.in);
    int num = kb.nextInt();
    for (int i = 0; i < num; i++) {
      int a = kb.nextInt();
      int b = kb.nextInt();
      int count = 0;
      for (int j = a; j < b; j++) {
        for (int k = j + 1; k <= b; k++) {
          //System.out.println("++++ "+j + " " + k + " ");
          if (isRecycled(j, k)) {
            count++;
            //System.out.print(count);
          }
          //System.out.println();
        }
      }
      System.out.println("Case #" + (i + 1) + ": " + count);
    }
  }
  public static boolean isRecycled(int a, int b) {
    String n = a + "";
    String m = b + "";
    int numLength = n.length();
    for (int i = 1; i < numLength; i++) {
      if (n.substring(0, i).equals(m.substring(numLength - i, numLength)) && n.substring(i, numLength).equals(m.substring(0, numLength - i))) {
        //System.out.println(" true");
        return true;
      }
    }
    return false;
  }
}

