Given items with mass and cost respectively.
They fill the knapsack, that can withstand a weight of no more than . Determine the set of items that can be carried in the knapsack that has the highest cost.
The first line contains a positive integer — the weight of the knapsack.
The second line contains positive integers — the weights of the items.
The third line contains positive integers — the cost of the items.
Print the numbers of items (numbers from to ) that will be included in the knapsack with the highest cost.