Optimal choice

Angel, a good friend of yours, has a truck that can transport a maximum weight $W$ . He has $n$ objects at home, each with weight $w_i$ and value $v_i$ . He will depart, so he wants to pick the most valuable subset of objects with total weight no larger than $W$ . However, Angel does not like to compute optimal solutions. Can you help him?

Input

Input consists of several cases with only integer numbers. Every case begins with $W$ and $n$ , followed by $n$ pairs $w_i$ , $v_i$ . Assume $1 \le W \le 10^{12}$ , $1 \le n \le 100$ , $1 \le w_i \le W$ , and $1 \le v_i \le 100$ .

Output

For every case, print three lines. On the first, print the largest possible total value. On the second, print the number of objects of the optimal subset. On the third, print in increasing order and separated by spaces the indices (starting at one) of the chosen objects. If there is more than one optimal solution, you can choose any one.

Problem information

Author: Salvador Roura

Generation: 2026-01-25T11:25:05.453Z