You will be given a definition of a task first, then some input of the task.
In this task, you are given inputs k, i, and A, where k and i are integers and A is a list. You need to find every ith element of A starting from the kth element. The process stops when the position of the next ith element exceeds the length of the list.

1, 1, ['d', 'B', '7821', '8029', 'J', 'o', 'z', 'I', 'J', 'G', '1613', 'n', '41', '1939', 'N', '4381']
Output:
d, B, 7821, 8029, J, o, z, I, J, G, 1613, n, 41, 1939, N, 4381