#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;

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