Maximize the Topmost Element After K Moves

Given a 0-indexed integer array nums representing the contents of a pile, where nums[0] represents the topmost element of the pile, and an integer k denoting the total number of moves to be made, the task is to find and print the maximum value of the topmost element of the pile after exactly k moves.

Each move can consist of one of the following operations:

1. Remove the topmost element of the pile if it's not empty.
2. Add any one of the removed elements back onto the pile. This added element becomes the new topmost element.

If it is impossible to obtain a non-empty pile after k moves, print -1.