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