You helped Dima to have a great weekend, but it's time to work. Naturally, Dima, as all other men who have girlfriends, does everything wrong. Inna and Dima are now in one room. Inna tells Dima off for everything he does in her presence. After Inna tells him off for something, she goes to another room, walks there in circles muttering about how useless her sweetheart is. During that time Dima has time to peacefully complete k - 1 tasks. Then Inna returns and tells Dima off for the next task he does in her presence and goes to another room again. It continues until Dima is through with his tasks. Overall, Dima has n tasks to do, each task has a unique number from 1 to n . Dima loves order, so he does tasks consecutively, starting from some task. For example, if Dima has 6 tasks to do in total, then, if he starts from the 5 -th task, the order is like that: first Dima does the 5 -th task, then the 6 -th one, then the 1 -st one, then the 2 -nd one, then the 3 -rd one, then the 4 -th one. Inna tells Dima off (only lovingly and appropriately!) so often and systematically that he's very well learned the power with which she tells him off for each task. Help Dima choose the first task so that in total he gets told off with as little power as possible. The first line of the input contains two integers n , k (1 ≤ k ≤ n ≤ 10 5 ) . The second line contains n integers a 1 , a 2 , ..., a n (1 ≤ a i ≤ 10 3 ) , where a i is the power Inna tells Dima off with if she is present in the room while he is doing the i -th task. It is guaranteed that n is divisible by k . In a single line print the number of the task Dima should start with to get told off with as little power as possible. If there are multiple solutions, print the one with the minimum number of the first task to do. Explanation of the first example. If Dima starts from the first task, Inna tells him off with power 3, then Dima can do one more task (as k = 2), then Inna tells him off for the third task with power