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.dagova.recycledNumbers;

import java.util.TreeSet;

public class RecycledNumbersSolver
{
	private static int solution;
	private static int aNumber;
	private static int bNumber;

	
	public static int solve(String line)
	{
		solution = 0;
		
		String[] splittedLine = line.split(" ");
		aNumber = Integer.parseInt(splittedLine[0]);
		bNumber = Integer.parseInt(splittedLine[1]);
		
		for(int number = aNumber; number < bNumber-1; number++)
		{
			solution += solveNumber(number);
		}
		return solution;
	}

	
	public static int solveNumber(int number)
	{
		//	con el treeset evita que un n de varias veces el mismo m. Antes usaba el contador recycledNumbers y por eso fallaba.
		TreeSet<Integer> ms = new TreeSet<Integer>();
//		int recycledNumbers = 0;
		String numberAsString = Integer.toString(number);
		int numberLength = numberAsString.length();
		
		for(int charIterator = 1; charIterator < numberLength; charIterator++)
		{
			if(numberAsString.charAt(charIterator) >= numberAsString.charAt(0))
			{
				int recycledNumber = generateRecycledNumber(numberAsString, charIterator);
				if(recycledNumber <= bNumber && recycledNumber > number)
				{
					ms.add(recycledNumber);
//					recycledNumbers++;
				}
			}	
		}
		
		return ms.size();
//		return recycledNumbers;
	}
	
	
	public static int generateRecycledNumber(String numberAsString, int charIterator)
	{
		String prefix = numberAsString.substring(0, charIterator);
		String sufix = numberAsString.substring(charIterator);
		
		return Integer.parseInt(sufix.concat(prefix));
	}
}
