#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())//vectorの降順ソート
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;

typedef vector<unsigned int>vec;
typedef vector<vec> mat;
typedef tuple<ll, ll, ll> T;

int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n,m;
    cin>>n>>m;
    vector<ll> a(n);
    REP(i,n) cin>>a[i];
    vector<ll> ans;
    for(int i=0;i<n-m+1;i++){
        ll tmp=0;
        int j=0;
        while(a[i+j]%2!=0){
            tmp+=a[i+j];
            j++;
        }
        if(tmp&&j>=m) ans.push_back(tmp),i+=j-1;
    }
    for(auto x:ans) cout<<x<<endl;
}