#include <bits/stdc++.h>
using namespace std;
#define rep(i , a, b) for(int i = a; i < (b) ; ++i)
#define all(x) std::begin(x), std::end(x)
#define sz(x) ((int) x.size())
typedef long long ll;
#define int ll
typedef pair<int,int> pii;

typedef vector<int> vi;

const ll mod = 1'000'000'007;

ll modpow(ll b, ll e) {
    ll ans = 1;
    for(;e ; b = b*b%mod,e/=2) {
        if(e & 1) ans = ans * b % mod;
    }
    return ans;
}



signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int N, M;

    cin >> N >> M;
    vector<int> nums;
    nums.resize(N);

    vector<int> group_current;

    vector<int> group_index;
    group_index.resize(N);

    int groupcnt = 0;
    group_current.resize(groupcnt + 1);

    int cnt_even_groups = 0;

    for (int i = 0; i < N; ++i) {
        cin >> nums[i];
        group_index[i] = groupcnt;
        group_current[groupcnt] += nums[i] % 2 == 0;
        if(i == N - 1) continue;
        char symbol;
        cin >> ws >> symbol;

        if(symbol == '-' || symbol == '+') {
            if(group_current[groupcnt]) {
                cnt_even_groups++;
            }
            groupcnt ++;
            group_current.push_back(0);
        }
    }

    if(group_current[groupcnt]) {
        cnt_even_groups++;
    }

    cnt_even_groups += groupcnt % 2 == 0;
    cout << ((cnt_even_groups % 2) ? "odd" : "even") << endl;

    for (int i = 0; i < M; ++i) {
        int index,new_num;
        cin >> index >> new_num;
        index--;
        int orig = nums[index];
        if(abs(orig % 2) == abs(new_num % 2)) {
            cout << ((cnt_even_groups % 2) ? "odd" : "even") << endl;
            continue;
        }
        nums[index] = new_num;
        if(new_num % 2 == 0) {
            if(group_current[group_index[index]] == 0) {
                cnt_even_groups++;
            }
            group_current[group_index[index]]++;
        } else {
            group_current[group_index[index]]--;
            if(group_current[group_index[index]] == 0) {
                cnt_even_groups--;
            }
        }
        cout << ((cnt_even_groups % 2) ? "odd" : "even") << endl;
    }


    return 0;


    cin.tie(0)->sync_with_stdio(0);


    int D, R;

    cin >> D >> R;

    D = R = 50;
    cout << -3%2 << -2%2 << endl;

    vector<vector<vector<vector<int>>>> dyn(R * R + 1);

    dyn[1].push_back(vector<vector<int>>(1, {1}));

    for(int i = 1; i <= R * R; i++) {
        for(int offset = 1; offset * offset <= i; offset++) {

        }
    }



    return 0;
}