Java Code Only: The chef gives you an A sequence of N's length. Let X mean MEX for A sequence. The cook is interested in calculating the correct values k, so that, if the whole part of Ai A is...

Extracted text: Java Code Only: The chef gives you an A sequence of N's length. Let X mean MEX for A sequence. The cook is interested in calculating the correct values k, so that, if the whole part of Ai A is replaced by max (Ai – k, 0), the MEX sequence remains X.. Find calculations for such values. If there are such endless numbers, print - 1 instead. As a friendly reminder, MEX sequence is the smallest non-negative number non-sequential. Input 1 4 1235 Output