time limit per test: 0.25 sec. memory limit per test: 4096 KB
input: standard output: standard
You are given integer numbers N and K and an array D[0..N-1] of decimal digits (0<=D[i]<=9, D[i] is an integer). Consider an array A of real numbers, such that integer part of A[i] is equal to zero, and fractional part is an infinite decimal fraction with digits D[[(i + 0K) mod N], D[(i + 1K) mod N], D[(i + 2K) mod N] and so on. For example, for N = 3, K = 2 and D = '194':