#include <iostream>
#include <vector>

using lint = long long;

void solve() {
    int n, m;
    std::cin >> n >> m;

    int cnt = 0;
    lint sum = 0;
    while (n--) {
        lint x;
        std::cin >> x;

        if (x % 2 == 0) {
            if (cnt >= m) std::cout << sum << "\n";
            cnt = 0;
            sum = 0;
        } else {
            ++cnt;
            sum += x;
        }
    }

    if (cnt >= m) std::cout << sum << "\n";
}

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

    solve();

    return 0;
}