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