As input you'll receive the information about the vault contents in the following format: {'golden coin': {'price': 100, 'weight': 50, 'amount': 200}, 'silver coin': {'price': 10, 'weight': 20, 'amount': 1000} , 'ruby': {'price': 1000, 'weight': 200, 'amount': 2}}, where price is measured in the standard units of your country's currency, weight is measured in grams, and amount is measured in pieces.
In addition, you'll also have a weight limit (in kilograms), over which you won't be able to carry.

Your task is to collect such a set of treasures so that their total weight doesn't exceed the limit, and their total cost was as high as possible. The answer must be returned as the list of strings, for example: ['golden coin: 150', 'silver coin: 700', 'ruby: 2']. There always be 3 types of the treasures (golden coin, silver coin and ruby) and it should be represent in the answer in the same order. If some type of the treasures are out of limit (so you 'can' take it 0) - just don't include it into answer.

Input: Dictionary with information about treasures and weight limit.

Output: All treasures, which you take (a list of strings).

treasures({'golden coin': 
              {'price': 100, 'weight': 50, 'amount': 200}, 
           'silver coin': 
              {'price': 10, 'weight': 20, 'amount': 1000}, 
           'ruby': 
              {'price': 1000, 'weight': 200, 'amount': 2}}, 5) == [
               'golden coin: 92', 'ruby: 2']

How it is used: For finding the optimal set of the objects.

Precondition :
3 types of treasures