#include <iostream>
#include <cassert>

using namespace std;

int main() {
  int N, M;
  scanf("%d %d", &N, &M);
  static int A[100000];
  for (int i = 0; i < N; i++) {
    scanf("%d", &A[i]);
  }
  int i = 0;
  while (i < N) {
    if (A[i] % 2 == 0) {
      i++;
      continue;
    }
    long long ans = 0;
    int k = 0;
    while (i < N && A[i] % 2 == 1) {
      ans += A[i];
      i++;
      k++;
    }
    if (k >= M) {
      printf("%lld\n", ans);
    }
  }
}