#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define INF 1145141919
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
int ny, nx;
typedef long long int ll;
using namespace std;

ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }

ll lcm(ll m, ll n)
{
    if ((0 == m) || (0 == n))
        return 0;
    return ((m / gcd(m, n)) * n);
}

ll llpow(ll x, ll y)
{
    ll ans = 1;
    REP(i, y)
    ans *= x;
    return ans;
}

int ctoi(char c)
{
    if (c >= '0' && c <= '9')
    {
        return c - '0';
    }
    return 0;
}
////////////////////////////////////////////////////////////////////
int main()
{
    int N,M; cin >> N >> M;
    vector<ll> a(N);
    REP(i,N) cin >> a[i];

    /*vector<ll> s(N+1,0);
    REP(i,N) s[i+1] = s[i] + a[i];

    REP(i,N) cout << s[i] << endl;*/
    ll ans=0;
    bool flag=false;
    ll cnt=0;
    ll hold=0;
    REP(i,N){
        if(a[i]%2!=0){
            flag=true;
            cnt++;
            hold+=a[i];
        }else if(a[i]%2==0 or i==(N-1)){
            if(a[i]%2==0) flag=false;
            if(hold!=0) cout << hold << endl;
            if (i != (N - 1))
            {
                cnt = 0;
                hold = 0;
            }
            ans=0;
        }
        //cout << "flag= " << flag << " cnt= " << cnt << " hold= " << hold << endl;

        if(i==(N-1)) cout << hold << endl;
    }

    return 0;
}