#include <bits/stdc++.h>

using namespace std;
#define starburst ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);

#define FOR(i, a, b) for(int i = a;i<b;i++)
#define rFOR(i, a, b) for(int i = b-1;a-1<i;i--)

#define ll long long


string odd = "odd";

void eval(bool odd_count) {
    if (odd_count % 2 == 0) {
        cout << "even";
    } else {
        cout << (odd);
    }
}

bool even(int num) {
    return num % 2 == 0;
}

int main() {
    starburst

    int N, M;
    vector<pair<int, int>> res(N);
    vector<int> counts;
    cin >> N >> M;

    char expr = '+';
    int sum = 0;
    FOR(i, 0, N) {
        int n;
        cin >> n;
        if (expr == '*' ) {
            res[i] = {n, (int) counts.size()-1};
            if( even(n)) {
                counts[counts.size()-1]++;
            }
        } else {
            if (counts.size() != 0) {
                if (counts[counts.size()-1] == 0) {
                    sum += 1;
                }
            }
            res[i] = {n, (int) counts.size()};
            if (even(n)){
                counts.push_back(1);
            } else {
                counts.push_back(0);
            }
        }
        if( i != N-1) {
            cin >> expr;
        }
        
    }

    // FOR(i, 0, N) {
    //     cout << "(" << res[i].first << " " << res[i].second << ") ";
    // }
    // FOR(i, 0, counts.size()) {
    //     cout << counts[i]<<" ";
    // }
    // return 0;
    // cout << (sum);

    eval(sum);
    cout << endl;

    FOR(i, 0, M) {
        int a, b;
        cin >> a >> b;
        a-=1;
        int j = res[a].second;
        int diff = res[a].first % 2 - b % 2;
        res[a] = {b, res[a].second};
        if (diff) {
            if (!counts[j]) {
                sum -= 1;
            }
            counts[i] += diff;
            if (!counts[j]) {
                sum += 1;
            }
        }

        eval(sum);
        cout << endl;
    }


    return 0;
}