#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <iomanip>
#include <bitset>
#include <cassert>
using namespace std;
typedef long long ll;

int main() {
	int n, m; cin >> n >> m;
	vector<ll> a(n), ac(n + 1);
	for (int i = 0; i < n; i++) cin >> a[i];
	for (int i = 0; i < n; i++) ac[i + 1] = ac[i] + a[i];
	vector<ll> ans;
	int pos = 0;
	while (pos < n) {
		int cnt = 0;
		while (pos + cnt < n && a[pos + cnt] & 1) cnt++;
		if (cnt >= m) ans.push_back(ac[pos + cnt] - ac[pos]);
		pos += cnt + 1;
	}
	for (auto t : ans) cout << t << endl;
	return 0;
}