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 com.sokamura.gcj2012;

import java.io.BufferedReader;
import java.io.FileReader;
import java.util.HashSet;
import java.util.Set;

public class RecycledNumbers {
	public int solve(int n1, int n2) {
		int ans = 0;
		for(int i=n1; i<n2; ++i) {
			Set<Integer> list = generate(i);
			for(int n : list) {
				if(n <= n2){ ans++; }
			}
		}
		return ans;
	}
	
	private Set<Integer> generate(int n) {
		String s = String.valueOf(n);
		Set<Integer> list = new HashSet<Integer>();
		for(int i=1; i<s.length(); ++i) {
			int n2 = Integer.parseInt(s.substring(i) + s.substring(0, i));
			if(n < n2) {
				list.add(n2);
			}
		}
		return list;
	}
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO ©®¶¬³ê½\bhEX^u
		RecycledNumbers rn = new RecycledNumbers();
		try {
			FileReader fr = new FileReader("C-small-attempt1.in");
			BufferedReader br = new BufferedReader(fr);
			String lineNum;
			lineNum = br.readLine();
			for(int i=1; i<=Integer.parseInt(lineNum); ++i) {
				String line = br.readLine();
				String[] array = line.split(" ");
				int n1 = Integer.parseInt(array[0]);
				int n2 = Integer.parseInt(array[1]);
				System.out.println("Case #" + i + ": " + rn.solve(n1,n2));
			}
		}
		catch(Exception e) {
			e.printStackTrace();
		}
	}

}
