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 br.com.problema.c;

import java.util.HashSet;

public class Numero {

	int num;

	public Numero(int num) {
		this.num = num;
	}

	public HashSet<Integer> numRecycled(int B) {
		String s = num + "";
		HashSet<Integer> recycleds = new HashSet<Integer>();
		int numeroCasas = s.length();
		// System.out.print(num + "(");
		for (int i = 1; i < numeroCasas; i++) {
			String novoNum = s.substring(s.length() - i, s.length()) + s.substring(0, s.length() - i);
			int aux = Integer.parseInt(novoNum);

			if (aux <= B && aux > num) {
				recycleds.add(aux);
				// System.out.print(" " + aux);
			}
		}
		// System.out.print(")\n");

		return recycleds;
	}

	public int quantNumRecycled(int B) {
		return numRecycled(B).size();
	}
}
