If you are still timing out, you are using an inefficient algorithm. Some solutions solve this problem within a second.

ОК, thanks. To paste the solution (text of program) - was my mistake. I decided this task, the other comment helped me.

First of all. Do not paste solutions on discussion. If you cannot find the solution yourself unblock solutions. You don't deserve expertise so you can give it up.

There is faster solution for that, which I was not aware until I unlocked solutions.

Your solution is O(n log_K n)