Given a list of numbers nums and a non-negative integer k, rotate the list to the right by k positions. The elements from the end move back to the beginning, like the list is wrapping around in a circle. If k is larger than the list length, full extra rotations do not change the result. Return the new rotated list.

def rotate_right(nums: list[int], k: int) -> list[int]: