Given integers n and k such that

0 < n <= 10^6

0 < k <= 10^3

and a string S of length n.

Find any substring of length k in S with maximum number of occurrences. I don't care about the obvious complete search solution.

example

n=10 k=3

abcabcabcd

ans is "abc" repeated 3 times.