import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write

N,M=map(int,readline().split())
A=[0]+list(map(int,readline().split()))+[0]
L,R=[],[]
for i in range(1,N+2):
    if A[i-1]%2==0 and A[i]%2:
        L.append(i)
    if A[i-1]%2 and A[i]%2==0:
        R.append(i)
for l,r in zip(L,R):
    if r-l>=M:
        ans=sum(A[l:r])
        print(ans)