#include <bits/stdc++.h>
using namespace std;
#define REP(i,N) for(i=0;i<N;i++)
typedef long long ll;
typedef pair<int, int> P;
typedef struct{
  int first;
  int second;
  int third;
}T;

//昇順
bool comp_Se(T& l, T& r){
  return l.second < r.second;
}

int main(void){
  ll i,N,M,sum=0,count=0;
  cin >> N >> M;
  vector<int> v(N);
  REP(i,N){
    cin >> v[i];
    if(v[i]%2){
      sum+=v[i];
      count++;
    }else{
      if(count >= M) cout << sum << endl;
      count = 0;
      sum = 0;
    }
  }
  if(count >= M) cout << sum << endl;
  return 0;
}