import java.util.HashSet;
import java.util.Scanner;

public class C {

	static HashSet p = new HashSet();
	static int low;
	static int high;
	int count = 0;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int no = sc.nextInt();

		for (int i = 1; i <= no; i++) {

			p.clear();
			low = sc.nextInt();
			high = sc.nextInt();

			for (int l = low; l <= high; l++) {
				recycle(l);
			}
			System.out.println("Case #" + i + ": " + p.size());

		}
	}

	public static void recycle(int no) {

		String s = Integer.toString(no);
		for (int i = 0; i < s.length(); i++) {
			String rec = s.substring(i) + s.substring(0, i);
			int r = Integer.parseInt(rec);
			if (r != no && r >= low && r <= high) {
				int min = Math.min(r, no);
				int max = Math.max(r, no);
				String a = Integer.toString(min) + "" + Integer.toString(max);
				p.add(a);

			}
		}

	}
}

package gcj2012qr;

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

import com.google.*;

/**
 * @author Roman Kosenko <madkite@gmail.com>
 */
public class RecycledNumbers extends SingleThreadSolution<Object> {
	public static void main(String[] args) throws Exception {
		solve(new SolutionFactory<Object>() {
			public Callable<Object> read(BufferedReader br) throws IOException {
				String[] ss = br.readLine().split(" ");
				assert ss.length == 2;
				return new RecycledNumbers(Integer.parseInt(ss[0]), Integer.parseInt(ss[1]));
			}
		}, "google/src/gcj2012qr/" + "C-large.in");
	}
	private final int a, b;
	public RecycledNumbers(int a, int b) {
		this.a = a;
		this.b = b;
	}
	public String call() throws Exception {
		int result = 0;
		for(int i = a; i < b; i++) {
			int p = 1;
			for(int t = i / 10; t != 0; p *= 10)
				t /= 10;
			for(int t = i;;) {
				t = t / 10 + p * (t % 10);
				if(t == i)
					break;
				if(t > i && t <= b)
					result++;
			}
		}
		return Integer.toString(result);
	}
}
