The beloved Cookie Monster from Sesame Street has stumbled upon a table with sorted piles of cookies, each pile a positive integer. However, the monomaniacal obsessiveness of the Count who set up this crumbly fiesta has recently escalated to a whole new level of severity. The Count insists that these cookies must be eaten in the smallest possible number of moves. Each move chooses one of the remaining pile sizes p, and removes p cookies from every pile that contains at least p cookies (thus eradicating all piles with exactly p cookies), and leaves all smaller piles as they were.

Since the Count also has an unhealthy obsession with order and hierarchies, he expects these moves to be done in decreasing order of values of p. This function should return the array of moves, that allows Cookie Monster to scarf down these cookies. If there are a few optimal sequences of moves, choose the lexicographically largest one. Look at the example for [1, 2, 3, 4, 5, 6] input.

Input: Array of integers (number).

Output: Array of integers (number).

Examples:

assert.deepStrictEqual(cookieMonster([1, 2, 3]), [2, 1]);
assert.deepStrictEqual(cookieMonster([1, 2, 3, 4, 5, 6]), [4, 2, 1]);
assert.deepStrictEqual(
...