#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define INF 1000000000000000000
typedef pair<ll, ll> pll;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N, M;
    cin >> N >> M;
    vector<ll> A(N), ans;
    rep(i, N) { cin >> A[i]; }

    ll s = 0, c = 0;
    rep(i, N) {
        if (A[i] % 2 == 1) {
            c++;
            s += A[i];
        } else {
            if (c >= M) {
                ans.push_back(s);
            }
            s = 0, c = 0;
        }
    }

    if (c >= M) {
        ans.push_back(s);
    }

    rep(i, ans.size()) { cout << ans[i] << endl; }
}