#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;

int main()
{
    int n, m; cin>>n>>m;
    ll s[100001]; s[0]=0;
    ll a[100001];
    for(int i=1; i<=n; i++){
        cin>>a[i]; s[i]=s[i-1]+a[i];
    }
    int ct=0;
    for(int i=1; i<=n; i++){
        if(a[i]%2==1) ct++;
        else{
            if(ct>=m) cout<<s[i-1]-s[i-ct-1]<<endl;
            ct=0;
        }
    }
    if(ct>=m) cout<<s[n]-s[n-ct]<<endl;
    return 0;
}