#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int i = ((int)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(int i = ((int)(b));i>=((int)(a));i--)
typedef long long ll;
typedef pair<ll, ll> mp;
ll mod = 1e9+7;

/*

*/

ll n,m,a[100010],sum=0,cnt=0;

int main(void){
	cin>>n>>m;
	rep(i,n)cin>>a[i];
	rep(i,n){
		if(a[i]%2==1){
			cnt++;
			sum+=a[i];
		}else{
			if(cnt>=m){
				cout<<sum<<endl;
			}
			sum=0;
			cnt=0;
		}
	}
	if(cnt>=m){
		cout<<sum<<endl;
	}
	return 0;
}