#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef pair<int,int> pint;
typedef pair<ll,int> pli;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;

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