#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
const ll MOD = 1000000007LL;

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

    int n, m;
    cin >> n >> m;

    vector <ll> vec(n+1, 0);
    for (int i = 0; i < n; i++) {
        cin >> vec[i];
    }

    int cnt = 0;
    ll sm = 0;
    for (int i = 0; i <= n; i++) {
        if (vec[i] % 2 == 0) {
            if (cnt >= m) {
                cout << sm << '\n';
            }
            cnt = 0;
            sm = 0;
        } else {
            cnt++;
            sm += vec[i];
        }
    }

    return 0;
}