#include<iostream>
#include<map>
#include<algorithm>
#include <iomanip>
#include <cmath>
#include <sstream>
#include <unordered_map>
#include <unordered_set>
#include <deque>
#include <vector>
#include <bitset>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <cstring>

#define INF 1050000000
#define MOD 1000000007

using namespace std;



int main() {
	int n, m; cin >> n >> m;
	int a[n + 1];
	memset(a, 0, sizeof(a));
	long long int sum = 0;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	for (int i = 0; i < n; i++) {
		if (a[i] % 2 == 1) {
			int count = 0;
			while (a[i] % 2 == 1) {
				sum += a[i];
				i++;
				count++;
			}
			if (count >= m) {
				cout << sum << endl;
			}
			sum = 0;
			count = 0;
		}
	}


}