/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package recyclednumbers;

import java.util.HashSet;

/**
 *
 * @author vandit
 */
public class RecycleNumbers {

    private HashSet<String> numbers = new HashSet<String>();
    private HashSet<String> initialTempNumbers = new HashSet<String>();
    private HashSet<String> finalTempNumbers = new HashSet<String>();

    HashSet<Pair> numberPairs = new HashSet<Pair>();


    private void findRecycledNumbers(int start, int end, int places) {


        for (int i = start; i <= end; i++) {
            String initialNumber = Integer.toString(i);
            //if (!(numbers.contains(initialNumber) || finalTempNumbers.contains(initialNumber))) {

                StringBuffer tempNumber = new StringBuffer(initialNumber);
                int len = tempNumber.length();
                int startIndexToMove = len - places;
                String tempString = tempNumber.substring(startIndexToMove);
                if ((places == 1 && tempString.equals("0")) || tempString.charAt(0) == '0') {
                    continue;
                }
                tempNumber.delete(startIndexToMove, len);
                String finalTempNumber = tempString + tempNumber.toString();

                if (! (finalTempNumber.equals(initialNumber) || Integer.parseInt(finalTempNumber) > end || Integer.parseInt(finalTempNumber) < Integer.parseInt(initialNumber))) {
                    numbers.add(initialNumber);
                    finalTempNumbers.add(finalTempNumber);
                    Pair pair = new Pair(finalTempNumber,initialNumber);
                    numberPairs.add(pair);
                }
            }

        

    }

    public HashSet<Pair> findAllRecycledNumbers(int start, int end) {
        int length = Integer.toString(start).length();
        for (int i = 1; i < length; i++) {
            findRecycledNumbers(start, end, i);
        }
        return numberPairs;
    }
}

/**
 * 
 */
package me.adrabi.codejam;

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
import java.util.Map;
import java.util.TreeMap;

/**
 * @author Adrabi Abderrahim, z3vil
 *
 */
public class P3
{
	public static void main(String[]$) throws NumberFormatException, IOException
	{
		List<String> recycled = new ArrayList<String>();
		{
			BufferedReader reader = new BufferedReader( new InputStreamReader(new FileInputStream("p3")));
			int count = Integer.parseInt(reader.readLine());
			
			String line = null;
			while((line = reader.readLine()) != null)
			{
				recycled.add(line);
			}
		}
		
		int currentLine = 1;
		for(String line : recycled)
		{
			String numbers[] = line.split(" ");
			if(numbers.length > 1)
			{
				Map<String, Integer> tmp = new TreeMap<String, Integer>();
				
				int a = Integer.parseInt(numbers[0]), b = Integer.parseInt(numbers[1]), count = 0;
				
				for(int index = a ; index <= b; index++)
				{
					String array[] = (index+"").split("");
					
					if(isSimilare(array))
					{
						continue;
					}
					
					List<String> elements = toList(array);
					
					int steps = array.length - 2;
					while(steps >= 1)
					{
						String element = elements.get(elements.size() - 1);
						elements.remove(elements.size() - 1);
						elements.add(0, element);
						steps--;
						
						String number = toString(elements);
						if(number.startsWith("0"))
						{
							continue;
						}
						else if(number.endsWith("00"))
						{
							continue;
						}
						else
						{
							int testNumber = Integer.parseInt(number);
							if( index < testNumber && testNumber <= b )
							{
								if(tmp.containsKey(number))
								{
									tmp.put(number, tmp.get(number) + 1);
								}
								else
								{
									tmp.put(number, 1);
								}
								if(tmp.get(number) < 4)
								{
									count++;
								}
							}
						}
					}
				}
				
				System.out.printf("Case #%d: %d\n", currentLine++, count);
			}
			else
			{
				System.out.printf("Case #%d: 0\n", currentLine++);
			}
		}
		
		
	}
	
	private static boolean isSimilare(String[]array)
	{
		String lastElement = array[1];
		boolean check = true;
		for(int start = 2; start < array.length; start++)
		{
			if(!lastElement.equals(array[start]))
			{
				check = false;
				break;
			}
			lastElement = array[start];
		}
		return check;
	}
	
	private static String toString(List<String> list)
	{
		String str = "";
		for(String tmp : list)
		{
			str += tmp;
		}
		return str;
	}
	
	private static List<String> toList(String array[])
	{
		List<String> list = new ArrayList<String>();
		for(int start = 1; start < array.length; start++)
		{
			list.add(array[start]);
		}
		return list;
	}
}
