#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <utility>
#include <queue>
#include <set>
#include <map>
#include <deque>
#include <iomanip>
#include <cstdio>
#include <stack>
#include <numeric>

using namespace std;
typedef  long long ll;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define  MP make_pair
#define  PB push_back
#define inf 1000000007
#define mod 1000000007
#define rep(i,n) for(int i=0;i<(int)(n);++i)

int main(){
    int n,m;
    cin >> n >> m;
    vector<ll> a(n);
    rep(i,n)cin >> a[i];
    rep(i,n){
        ll sm = 0;
        int cnt = 0;
        for(int j=i;j<n;j++){
            if(a[j]%2==1){
                cnt++;
                sm += a[j];
            }else{
                break;
            }
            if(cnt>=m)cout << sm << endl;
        }
    }
    return 0;
}