Given n items with mass m1,m2,...,mn and cost c1,c2,...,cn respectively.
They fill the knapsack, that can withstand a weight of no more than s. Determine the set of items that can be carried in the knapsack that has the highest cost.
The first line contains a positive integer s(s≤104) — the weight of the knapsack.
The second line contains n(n≤100) positive integers mi(mi≤100) — the weights of the items.
The third line contains n positive integers ci(ci≤100) — the cost of the items.
Print the numbers of items (numbers from 1 to n) that will be included in the knapsack with the highest cost.