def largestPermutation(k, arr):
    indices = {a: b for b, a in enumerate(arr)}
    for i in range(len(arr)):
        if k > 0:
            if arr[i] != len(arr) - i:
                value = copy.deepcopy(arr[i])
                arr[i], arr[indices[len(arr) - i]] = len(arr) - i, arr[i]
                indices[value] = indices[len(arr) - i]
                k -= 1
    return arr