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

public class C {

    void solve() throws IOException {
        in("C-large.in"); out("C-large.out");

        long tm = System.currentTimeMillis();
        boolean[] mask = new boolean[2000000];
        int[] r = new int[10];
        int t = readInt();
        for (int cs = 1; cs <= t; ++cs) {
            int a = readInt();
            int b = readInt();
            int ans = 0;
            for (int m = a + 1; m <= b; ++m) {
                char[] d = String.valueOf(m).toCharArray();
                int c = 0;
                for (int i = 1; i < d.length; ++i) {
                    if (d[i] != '0' && d[i] <= d[0]) {
                        int n = 0;
                        for (int j = 0; j < d.length; ++j) {
                            int jj = i + j;
                            if (jj >= d.length) jj -= d.length;
                            n = n * 10 + (d[jj] - '0');
                        }
                        if (n >= a && n < m && !mask[n]) {
                            ++ans;
                            mask[n] = true;
                            r[c++] = n;
                        }
                    }
                }
                for (int i = 0; i < c; ++i) {
                    mask[r[i]] = false;
                }
            }
            println("Case #" + cs + ": " + ans);
            //System.out.println(cs);
        }
        System.out.println("time: " + (System.currentTimeMillis() - tm));
        exit();
    }

    void in(String name) throws IOException {
        if (name.equals("__std")) {
            in = new BufferedReader(new InputStreamReader(System.in));
        } else {
            in = new BufferedReader(new FileReader(name));
        }
    }

    void out(String name) throws IOException {
        if (name.equals("__std")) {
            out = new PrintWriter(System.out);
        } else {
            out = new PrintWriter(name);
        }
    }

    void exit() {
        out.close();
        System.exit(0);
    }

    int readInt() throws IOException {
        return Integer.parseInt(readToken());
    }

    long readLong() throws IOException {
        return Long.parseLong(readToken());
    }

    double readDouble() throws IOException {
        return Double.parseDouble(readToken());
    }

    String readLine() throws IOException {
        st = null;
        return in.readLine();
    }

    String readToken() throws IOException {
        while (st == null || !st.hasMoreTokens()) {
            st = new StringTokenizer(in.readLine());
        }
        return st.nextToken();
    }

    boolean eof() throws IOException {
        return !in.ready();
    }

    void print(String format, Object ... args) {
        out.println(new Formatter(Locale.US).format(format, args));
    }

    void println(String format, Object ... args) {
        out.println(new Formatter(Locale.US).format(format, args));
    }

    void print(Object value) {
        out.print(value);
    }

    void println(Object value) {
        out.println(value);
    }

    void println() {
        out.println();
    }

    StringTokenizer st;

    BufferedReader in;
    PrintWriter out;

    public static void main(String[] args) throws IOException {
        new C().solve();
    }
}

import java.util.Scanner;

public class C2 {

  /**
   * @param args
   */
  public static void main(String[] args) {
    new C2();
  }

  int a, b, nbrDigits;
  // All numbers that we have already seen
  boolean[] seen;

  C2() {
    Scanner sc = new Scanner(System.in);
    int nbrCases = sc.nextInt();
    for (int i = 1; i <= nbrCases; ++i) {
      sc.nextLine();
      System.out.print("Case #" + i + ": ");

      a = sc.nextInt();
      b = sc.nextInt();
      nbrDigits = nbrDigits(a);

      seen = new boolean[b + 1];
      for (int j = 0; j <= b; ++j) {
        seen[j] = false;
      }

      int result = 0;
      for (int j = a; j <= b; ++j) {
        result += nbrRecycledLocal(j);
      }
      System.out.println(result);
    }
  }

  /**
   * Get the number of recycled pairs starting from the given number
   * 
   * @param start
   *          the number to start from
   * @return the number of recycled pairs between a and b
   */
  int nbrRecycledLocal(int start) {
    if (seen[start]) {
      return 0;
    }
    seen[start] = true;

    byte[] parts = separate(start);
    int hits = 0;

    for (int i = 1; i < nbrDigits; ++i) {
      int recycled = getRecycled(parts, i);

      if (recycled != start && recycled >= a && recycled <= b && !seen[recycled]) {
        ++hits;
        seen[recycled] = true;
      }
    }

    if (hits <= 1) {
      return hits;
    }

    int res = 1;
    for (int i = 2; i <= hits; ++i) {
      res += i;
    }
    return res;
  }

  /**
   * Get the number of digits in the given number
   * 
   * @param number
   *          the number
   * @return the number of digits in the number
   */
  int nbrDigits(int number) {
    int digits = 0;
    while (number != 0) {
      number /= 10;
      digits++;
    }
    return digits;
  }

  /**
   * Separate the given number into its digits
   * 
   * @param start
   *          the number
   * @return an array with the digits of the number
   */
  byte[] separate(int start) {
    byte[] res = new byte[nbrDigits];

    for (int i = 0; i < nbrDigits; ++i) {
      res[nbrDigits - 1 - i] = (byte) (start % 10);
      start = start / 10;
    }

    return res;
  }

  /**
   * Get the recycled number given the start number and the number of steps to
   * move the digits
   * 
   * @param start
   *          the original number in digits
   * @param steps
   *          the steps to take
   * @return the recycled number
   */
  int getRecycled(byte[] start, int steps) {
    int res = 0;
    int factor = 1;
    int size = start.length;

    for (int i = 0; i < size; ++i) {
      int pos = (size - 1 - i + steps) % size;
      res += factor * start[pos];
      factor *= 10;
    }

    return res;
  }
}
