Given the head of a linked list, reverse the nodes k at a time and return the modified list. If the number of remaining nodes is fewer than k, leave them as is.