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);
	}
}

package gcj;

import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;

class Recycled {
	Scanner sc;
	PrintWriter pw;
	
	int t, a, b, n, m, y;

	Recycled() {
		try {
			sc = new Scanner(new File("C-small-attempt0.in"));
			pw = new PrintWriter(new FileWriter("out-small.txt"));
		} catch (IOException e) {
		}
		
		t = sc.nextInt();
		int caseNum = 1;
		
		while (caseNum <= t) {
			y = 0;
			a = sc.nextInt();
			b = sc.nextInt();
			
			n = a;
			m = b;
			while (n < m) {
				while (m > n) {
					recycle(n, m);
					m--;
				}
				n++;
				m = b;
			}
			pw.println("Case #" + caseNum + ": " + y);
			caseNum++;
		}
		pw.flush();
		pw.close();
	}

	void recycle(int a, int b) {
		char[] n = String.valueOf(a).toCharArray();
		char[] m = String.valueOf(b).toCharArray();
		char[] shifted = null;

		for (int i = n.length - 1; i > 0; i--) {
			shifted = shift(n, i);
			if (equal(shifted, m)) {
				this.y++;
				return;
			}
		}
	}

	private char[] shift(char[] x, int start) {
		char[] ret = new char[x.length];

		int i = start;
		for (int j = 0; j < x.length; j++) {
			if (i < x.length) {
				ret[j] = x[i];
				i++;
			} else {
				i = 0;
				ret[j] = x[i];
				i++;
			}
		}
		return ret;
	}

	boolean equal(char[] a, char[] b) {
		for (int i = 0; i < a.length; i++) {
			if (a[i] != b[i])
				return false;
		}
		return true;
	}

	public static void main(String[] args) {
		new Recycled();
	}

}
