Read from standard input two natural numbers n and k, then n integers in an array. Rotate the array k positions to the left and print the result.
One left rotation moves the first element to the end. Rotating by k positions repeats this operation k times (equivalently, position i in the result corresponds to position (i + k) % n in the original array).