#define _USE_MATH_DEFINES #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; ///////////////////library zone!!!!!!!!!!!!!!!!!!!!!!!!!!!! typedef long long ll; typedef long double ld; #define all(a) (a).begin(),(a).end() #define EPS (1e-5) #define bit(n,k) ((n>>k)&1) const ll Mod = 1000000007; const ll mod = 998244353; struct H { ll x, y; bool operator<(const H &b) const { if (x != b.x) return x < b.x; return y < b.y; } bool operator>(const H &b) const { if (x != b.x) return x > b.x; return y > b.y; } bool operator==(const H &b) const { return x == b.x&&y == b.y; } bool operator!=(const H &b) const { return (*this) != b; } }; struct P { ll pos, cost; bool operator<(const P &b) const { return cost < b.cost; } bool operator>(const P &b) const { return cost > b.cost; } }; struct B { ll to, cost; }; struct E { ll from, to, cost; bool operator<(const E &b) const { return cost < b.cost; } bool operator>(const E &b) const { return cost > b.cost; } }; template void chmin(T &a, U b) { if (a > b) a = b; } template void chmax(T &a, U b) { if (a < b) a = b; } template T max_0(T a) { if (a < 0) return 0; return a; } template T min_0(T a) { if (a > 0) return 0; return a; } ll read() { ll u; ll k = scanf("%lld", &u); return u; } ll gcd(ll i, ll j) { if (i > j) swap(i, j); if (i == 0) return j; return gcd(j%i, i); } ll mod_pow(ll x, ll n, ll p) { ll res = 1; while (n > 0) { if (n & 1) res = res * x % p; x = x * x % p; n >>= 1; } return res; }//x^n%p vectorsplit(string s, char c = ' ') { vectorvec; string h = ""; for (int i = 0; i < s.size();) { int j = i; while (j < s.size() && s[j] != ' ') { h += s[j++]; } if (h.size() > 0) vec.push_back(h); h = ""; i = j + 1; } return vec; } template void print_vec(vectora) { for (int i = 0; i < a.size(); i++) { cout << (i == 0 ? "" : " ") << a[i]; } cout << endl; } const ll Inf = 3023372036854775807; const int inf = 1500000000; #define int long long //---------------------------------------------------- int n, m; int a[200000]; signed main() { cin >> n >> m; int ans = 0, res = 0; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] % 2 == 1) ans += a[i], res++; if (a[i] % 2 == 0 && ans > 0) { if(res>=m)cout << ans << endl; ans = 0, res = 0; } } }