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

int main() {
	long long vals[100005];
	int tmp[100005];
	char ops[100005][10];
	int evenCnt[100005];
	int *eCnt[100005];
	int n, q;
	cin >> n >> q;
	cin >> vals[0];
	for (int i = 1; i < n; i++) {
		cin >> ops[i - 1] >> vals[i];
	}
	for (int i = 0; i < n; i++) {
		vals[i] = vals[i] % 2;
	}
	int pos = 0;
	tmp[0] = vals[0];
	for (int i = 1; i < n; i++) {
		if (ops[i - 1][0] == '*') {
			tmp[pos] *= vals[i];
			continue;
		}
		pos++;
		tmp[pos] = vals[i];
	}
	int total = 0;
	for (int i = 0; i <= pos; i++) {
		total = (total + tmp[i]) % 2;
	}
	int even = 0;
	for (int i = 0; i < n; i++) {
		if (vals[i] % 2 == 0) {
			even++;
		}
		evenCnt[i] = even;
		if (ops[i][0] != '*') {
			even = 0;
		}
	}
	eCnt[n - 1] = new int;
	*eCnt[n - 1] = 10;
	for (int i = n - 2; i >= 0; i--) {
		if (ops[i][0] == '*') {
			eCnt[i] = eCnt[i + 1];
			continue;
		}
		eCnt[i] = new int;
		*eCnt[i] = evenCnt[i];
	}
	
	int idx, val;
	cout << (total == 0 ? "even" : "odd") << endl;
	for (int i = 0; i < q; i++) {
		cin >> idx >> val;
		idx--;
		val = val % 2;
		if (val == 1 && vals[idx] == 0) {
			(*eCnt[idx])--;
			vals[idx] = val;
			if ((*eCnt[idx]) == 0) {
				total = 1 - total;
			}
		}
		if (val == 0 && vals[idx] == 1) {
			(*eCnt[idx])++;
			vals[idx] = val;
			if ((*eCnt[idx]) == 1) {
				total = 1 - total;
			}
		}
		cout << (total == 0 ? "even" : "odd") << endl;
	}
	/*
	for (int i = 0; i < n; i++) {
		cout << evenCnt[i] << " ";
	}
	cout << " <<" << endl;*/
	return 0;
}