package codejam;

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

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package codejam.y12.round0;

import utils.Jam;
import utils.JamCase;

/**
 *
 * @author fabien
 */
public class DancingGooglers extends Jam {

  public DancingGooglers(String filename) {
    super(filename);
  }

  @Override
  public JamCase getJamCase(int number) {
    return new Line(this, number, lines[number]);
  }

  private class Line extends JamCase {

    private String line;
    private int s;
    private int p;
    private int[] scores;

    public Line(Jam parent, int number, String line) {
      super(parent, number);
      this.line = line;
    }

    @Override
    public void parse() {
      String[] integers = line.split(" ");
      scores = new int[Integer.parseInt(integers[0])];
      s = Integer.parseInt(integers[1]);
      p = Integer.parseInt(integers[2]);
      int j = 0;
      for (int i = 3; i < integers.length; i++) {
        scores[j++] = Integer.parseInt(integers[i]);
      }
    }

    @Override
    public void solve() {
      int r = 0;
      if (p == 0) {
        r = scores.length;
      } else {
        float average = 0;
        float pnor = p - 1;
        float psus = p - 1.4f;
        for (int score : scores) {
          if (score > 0) {
            average = score / 3.0f;
            if (average > pnor) {
              r++;
            } else if (s > 0 && average >= psus) {
              r++;
              s--;
            }
          }
        }
      }
      result = Integer.toString(r);
    }
  }
}
