#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vll vector<ll>

void odd(){
    cout << "odd" << endl;
}

void even(){
    cout << "even" << endl;
}

int main() {
    vector<vll> chlev;

    ll N, M; cin >> N >> M;
    unordered_map<ll, ll> kteryChlevik;
    vll A(N);
    cin >> A[0];
    chlev.push_back({});
    chlev[0].push_back(A[0]);
    kteryChlevik[A[0]] = 0;
    for(ll i = 1; i < N; i++) {
        char temp;
        cin >> temp;
        if(temp == '+' || temp == '-'){
            chlev.push_back({});
        }

        cin >> A[i];
        kteryChlevik[A[i]] = chlev.size() - 1;
        chlev[chlev.size() - 1].push_back(A[i]);
    }

    vll chlevPar(chlev.size(), 0);
    for(ll i = 0; i < chlev.size(); i++){
        for(ll j = 0; j < chlev[i].size(); j++){
            if((chlev[i][j] & 1) == 0){
                chlevPar[i]++;
            }
        }
    }

    //prvni vypis
    ll nepar = 0;
    for(ll i = 0; i < chlevPar.size(); i++){
        if(chlevPar[i] == 0){
            nepar++;
        }
    }
    if((nepar & 1) == 1){
        odd();
    } else {
        even();
    }

    for(ll i = 0; i < M; i++){
        ll pos, val; cin >> pos >> val;
        pos--;

        ll num = A[pos];
        ll chlevNum = kteryChlevik[num];
        if((num & 1) == (val & 1)){
            if((nepar & 1) == 1){
                odd();
            } else {
                even();
            }
            continue;
        } else {
            if((val & 1) == 0){
                chlevPar[chlevNum]++;
                if(chlevPar[chlevNum] == 1) {
                    nepar++;
                }
            } else {
                chlevPar[chlevNum]--;
                if(chlevPar[chlevNum] == 0) {
                    nepar--;
                }
            }
        }
        if((nepar & 1) == 1){
            odd();
        } else {
            even();
        }
    }

    return 0;
}