#include <algorithm>
#include <iostream>
#include <vector>

inline void rotateArray(std::vector<int> &nums, int k) {
  int n = nums.size();
  if (n == 0) return;
  k %= n;

  std::reverse(nums.begin(), nums.end());
  std::reverse(nums.begin(), nums.begin() + k);
  std::reverse(nums.begin() + k, nums.end());
}