#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for (int i= a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (x).size()
#define int ll
#define F first
#define S second
#define PB push_back
#define MP make_pair
typedef long long int;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define endl '\n'
#define inf 3000000000000000000
#define random rand()^(rand()<<15)
mt19937 rnd(time(nullptr));

inline bool even(ll n) {
    return n % 2 == 0;
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    
    ll numbers, queries;
    cin >> numbers >> queries;

    vector<bool> values;
    vi group_values;
    vi group_ids;

    ll first;
    cin >> first;

    group_values.push_back(even(first));
    group_ids.push_back(0);
    values.push_back(even(first));

    for (ll i = 1; i < numbers; i++) {
        char op;
        ll num;
        cin >> op >> num;

        if (op == '*') {
            group_values.back() += even(num);
        } else {
            group_values.push_back(even(num));
        }

        values.push_back(even(num));
        group_ids.push_back(group_values.size() - 1);
    }

    bool value = true;

    for (ll v : group_values)
        value ^= v == 0;

    for (ll q = 0; q < queries; q++) {
        cout << (value ? "even" : "odd") << endl;

        ll pos, num;
        cin >> pos >> num;
        pos--;

        if (values[pos] == even(num))
            continue;

        values[pos] = even(num);

        ll id = group_ids[pos];

        ll prev = group_values[id];
        ll curr = prev;

        if (even(num))
            curr++;
        else
            curr--;

        group_values[id] = curr;

        if ((prev > 0) == (curr > 0))
            continue;
        
        value ^= 1;
    }

    cout << (value ? "even" : "odd") << endl;
}