from heapq import heappush,heappop
from collections import deque
t = 1
for tc in range(1,t+1):
n,k = map(int,input().split())
a = list(map(int,input().split()))
ans = float("inf")
ind = -1
for i in range(k):
j = i
s = 0
while j<n:
s+=a[j]
j+=k
if ans>s:
ans=s
ind=i
print(ind+1)#include <bits/stdc++.h>
#define Bankai ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
using namespace std;
int main() {
Bankai
int n,k,a;
cin>>n>>k;
vector<int>sum(k);
for(int i=0;i<n;i++){
cin>>a;
sum[i%k]+=a;
}
int mx=0;
for(int i=1;i<k;i++)
if(sum[mx]>sum[i])
mx=i;
cout<<mx+1;
return 0;
}437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |