import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;

public class Recycled {
    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            int t = Integer.parseInt(br.readLine());
            for (int i = 0; i < t; i++) {
                String[] str = br.readLine().split(" ");
                int a = Integer.parseInt(str[0]);
                int b = Integer.parseInt(str[1]);
                System.out.println("Case #" + (i + 1) + ": " + find(a, b));
            }
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    private static int find(int a, int b) {
        HashSet<Long> used = new HashSet<Long>();
        int digits = String.valueOf(a).length();
        if (digits == 1) return 0;
        for (int i = a; i <= b; i++) {
            int s = 10;
            int m = (int) Math.pow(10, digits-1);
            for (int j = 0; j < digits-1; j++) {
                int r = i % s;
                if (r < s/10) continue;
                int q = i / s;
                int rn = r * m + q;
                s *= 10; m /= 10;
                if (i != rn && rn >= a && rn <= b) {
                    long pp;
                    if (rn < i) pp = (long)rn << 30 | i;
                    else pp = (long)i << 30 | rn;
                    if (!used.contains(pp)) {
                        used.add(pp);
                    }
                }
            }
        }
        return used.size();
    }
}

import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;


public class CodeJamQ3 {

  public static String[] read(final String name) throws IOException {
    final InputStreamReader reader = new FileReader(new File(name));
    final char[] buf = new char[1024];
    int count = 0;
    final StringBuilder res = new StringBuilder();
    do {
      count = reader.read(buf);
      if (count > 0)
      res.append(buf, 0, count);
    } while (count != -1);
    return res.toString().trim().split("(\\r?\\n)+");
  }

  public static void main(final String[] args) throws Exception {
    final long start = System.currentTimeMillis();
    final String[] input = read("C-large.in");
    final FileWriter out = new FileWriter("out");

    final int casesCount = Integer.parseInt(input[0]);
    for (int caseN = 1; caseN <= casesCount; caseN++) {
      final String[] data = input[caseN].split("\\s+");
      final int a = Integer.parseInt(data[0]);
      final int b = Integer.parseInt(data[1]);

      out.write("Case #" + caseN + ": " + solve(a, b) + "\n");

    }

    out.close();
    System.out.println((System.currentTimeMillis() - start));
  }

  private static long solve(final int a, final int b) {
    System.out.print(".");
    long count = 0;
    final HashSet<Tuple> check= new HashSet<Tuple>();
    final char[] number = String.valueOf(b).toCharArray(), test= new char[number.length];
    final char[] numberB = String.valueOf(b).toCharArray();
    for (int x = a; x <= b; x++) {
      final String s = String.valueOf(x);
      s.getChars(0, s.length(), number, 0);
      s.getChars(0, s.length(), test, 0);
      for (int i = 1; i < number.length; i++) {

        final char c = test[0];
        for (int j = 1; j < number.length; j++) {
          test[j - 1] = test[j];
        }
        test[test.length - 1] = c;

        if (number[0] <= number[i] && number[i] != '0') {
          // check the number
          boolean ok = true, larger = false, smaller = false;
          int eq = 0;
          for (int j = 0; j < number.length; j++) {
            if (test[j] == number[j]) { eq++; }
            if (test[j] > number[j]) { larger = true; }
            if (test[j] < numberB[j]) { smaller = true; }
            if (larger && smaller) { break; }
            if (!larger && test[j] < number[j] || !smaller && test[j] > numberB[j]) {
              ok = false;
              break;
            }
          }
          if (!ok || eq == number.length) {continue; }

          final Tuple t = new Tuple(x, Integer.parseInt(new String(test)));
          if (check.contains(t)) { continue; }
          check.add(t);
          ++count;
        }
      }
    }
    return count;
  }

  private static class Tuple {
    int x, y;
    Tuple(final int x, final int y) {this.x = x; this.y = y; }
    @Override
    public int hashCode() {
      return x + y;
    }
    @Override
    public boolean equals(final Object obj) {
      final Tuple t = (Tuple)obj;
      return t.x == x && t.y == y || t.x == y && t.y ==x;
    }
  }

}
