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.*;
import java.util.*;
public class C {
  static int N = 2000001;
  static int[][] pair = new int[N][6];
  static int[] np = new int[N];

  public static void main (String[] args) throws IOException {
    BufferedReader in = new BufferedReader(new InputStreamReader(System.in));

	for (int i = 1; i <= 6; i++)
	  gen(i);
	gen(1000000, 2000000, 7);
	/*for (int i = 1; i < 1000; i++)
	  for (int j = 0; j < np[i]; j++)
	    System.out.println(i + " " + pair[i][j]);*/
	int T = Integer.parseInt(in.readLine());
	for (int t = 0; t < T; t++) {
	  StringTokenizer st = new StringTokenizer(in.readLine());
	  int A = Integer.parseInt(st.nextToken());
	  int B = Integer.parseInt(st.nextToken());
	  int count = 0;
	  for (int i = A; i <= B; i++)
	    for (int j = 0; j < np[i]; j++)
		  if (pair[i][j] <= B)
		    count++;
	  System.out.println("Case #"+(t+1)+": " + count);
	}
	in.close();
  }
  
  static void gen (int d) {
    gen(pow10(d-1), pow10(d)-1, d);
  }
  
  static void gen (int lb, int ub, int d) {
    for (int i = lb; i <= ub; i++) {
	  int n = i;
      for (int j = 0; j < d-1; j++) {
		n = (n%10)*lb+(n/10);
		if (n > i) {
		  boolean found = false;
		  for (int k = 0; k < np[i]; k++)
		  if (pair[i][k] == n)
		    found = true;
		  if (!found) {
		    pair[i][np[i]] = n;
		   np[i]++;
		  }
		}
      }
	}
  }
  
  static int pow10 (int n) {
    int res = 1;
	for (int i = 0; i < n; i++)
	  res *= 10;
	return res;
  }
}