//
// Yukicoder
// No.3044 April sum of Odd
//
// 
// 
//





//#include "stdafx.h"
#include <stdio.h>
#include <iostream>
#include <vector>
#include <list>//list
#include <set> //tree
#include <map> //連想配列
#include <unordered_set> //hash
#include <unordered_map> //hash
#include <algorithm>
#include <iomanip>
#include <string>
#include <stdlib.h>


using namespace std;
typedef unsigned long long ULL;
typedef signed long long SLL;
typedef unsigned int UINT;


#define START (0)
#define RIGHT (1)
#define UP    (2)
#define LEFT  (3)
#define DOWN  (4)

#define DATA_MAX (1000000)
#define FMAX(a,b)  ((a)>(b)?(a):(b))
#define FMIN(a,b)  ((a)<(b)?(a):(b))


vector <vector <SLL>> memo2;//二次元可変配列

vector<SLL> memo1;
vector<SLL> c;
vector<SLL> v;
vector<SLL> dp;

SLL H ,A, B, T, F, N, M, Result;

UINT hashtable;




int main(int argc, char *argv[])
{



	SLL a[100000];

	

	cin >> N;
	cin >> M;

	for (int i = 0; i < N; i++)
	{
		cin >> a[i];
	}

	
	SLL sum = 0;
	SLL count = 0;
	for(SLL i=0;i<N;i++)
	{
		if (a[i] % 2)
		{
			sum += a[i];
			count++;
		}
		else
		{
			if (count >= M)
				cout << sum << endl;

			count = 0;
			sum = 0;
		}
	}

	if (count >= M)
		cout <<  sum << endl;

	///////////////////
	cout << endl;
	getchar();
	

	return 0; //end
}