A12261 | Boxes Packing

Maksim has $n$ objects and $m$ boxes, each box has size exactly $k$ . Objects are numbered from $1$ to $n$ in order from left to right, the size of the $i$ -th object is $a_i$ .

Maksim wants to pack his objects into the boxes and he will pack objects by the following algorithm: he takes one of the empty boxes he has, goes from left to right through the objects, and if the $i$ -th object fits in the current box (the remaining size of the box is greater than or equal to $a_i$ ), he puts it in the box, and the remaining size of the box decreases by $a_i$ . Otherwise he takes the new empty box and continues the process above. If he has no empty boxes and there is at least one object not in some box then Maksim cannot pack the chosen set of objects.

Maksim wants to know the maximum number of objects he can pack by the algorithm above. To reach this target, he will throw out the leftmost object from the set until the remaining set of objects can be packed in boxes he has. Your task is to say the maximum number of objects Maksim can pack in boxes he has.

Each time when Maksim tries to pack the objects into the boxes, he will make empty all the boxes he has before do it (and the relative order of the remaining set of objects will not change).

The first line of the input contains three integers $n$ , $m$ , $k$ ( $1 \le n, m \le 2 \cdot 10^5$ , $1 \le k \le 10^9$ ) — the number of objects, the number of boxes and the size of each box.

The second line of the input contains $n$ integers $a_1, a_2, \dots, a_n$ ( $1 \le a_i \le k$ ), where $a_i$ is the size of the $i$ -th object.

Print the maximum number of objects Maksim can pack using the algorithm described in the problem statement.