Infinite fraction

You are given two numbers, $N$ and $K$, along with an array D[0..N-1] consisting of decimal digits (0 \le D[i] \le 9), where each $D[i]$ is an integer.

Consider an array $A$ of real numbers. Each $A[i]$ has an integer part equal to zero, and its fractional part is an infinite decimal sequence formed by the digits D[(i+0K) \bmod N], D[(i+1K) \bmod N], D[(i+2K) \bmod N], and so on.

For example, if N = 3, K = 2, D = '194':

A[1] = 0.149149149\ldots A[2] = 0.914914914\ldots A[3] = 0.491491491\ldots

You are required to determine the element in the array $A$ with the largest value and output the first $N$ digits of its fractional part.