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.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;


public class Recycled {
  public static void main(String[] args) {
    try {
      File input = new File("/Users/mtervahauta/Dev/mikkot/codejam/recycled.input");
      //File input = new File(args[0]);
      FileInputStream fStream = new FileInputStream(input);
      BufferedReader bReader = new BufferedReader(
          new InputStreamReader(fStream));
      int cases = Integer.parseInt(bReader.readLine());
      for (int i = 1; i <= cases; i++) {
        String[] values = bReader.readLine().trim().split(" ");
        solveRecycled(i, values[0], values[1]);
      }
    } catch (Exception e) {
      e.printStackTrace();
    }
  }
  
  private static void solveRecycled(int caseNo, String aStr, String bStr) {
    long a = Long.parseLong(aStr);
    long b = Long.parseLong(bStr);
    //Set<String> nms = new HashSet<String>();
    long count = 0;
    for (long n = a; n <= b; n++) {
      count = findM(count, a, n, b);
    }
    System.out.println("Case #" + caseNo + ": " + count);
  }

  private static long findM(long count, long a, long n, long b) {
    List<Long> recycledValues = recycledStrings(Long.toString(n));
    Set<String> nms = new HashSet<String>();
    for (Long recycledN : recycledValues) {
      long m = recycledN.longValue();
      if (n < m && m <= b) {
        nms.add(n+":"+m);
      }
    }
    return count + nms.size();
  }

  private static List<Long> recycledStrings(String src) {
    List<Long> resp = new ArrayList<Long>();
    int length = src.length();
    String recycled = null;
    for (int i = 1; i < length; i++) {
      recycled = src.substring(length - i);
      recycled = recycled + src.substring(0, length - i);
      if (!recycled.startsWith("0"))
        resp.add(new Long(Long.parseLong(recycled)));
    }
    return resp;
  }
 }