Construct Target Array With Multiple Sums

Determine whether a target array can be formed from an all-ones array by repeatedly replacing an element with the current total sum; solve by reversing the process greedily—repeatedly reduce the largest element by the sum of the rest (using a max-heap and modulo to skip many steps) until all ones or a contradiction is found. This requires careful handling of edge cases and large values to avoid infinite loops or invalid states.