#include <bits/stdc++.h>

//#pragma GCC optimize("O3")
//#define int long long

using namespace std;

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	int n, m;
	cin >> n >> m;
	vector<int> idx(n);
	vector<int> num_even;
	vector<int> a(n);
	int last = -1;
	for(int i = 0; i < n; i++){
		int x;
		cin >> x;
		x %= 2;
		a[i] = x;
		char c = '+';
		if(i < n-1) cin >> c;
		if(c != '*'){
			int ev = 0;
			for(int j = last+1; j <= i; j++){
				idx[j] = num_even.size();
				if(!a[j]) ev++;
			}
			num_even.push_back(ev);
			last = i;
		}
	}
	int k = num_even.size();
	int L = 1<<(int)ceil(log2(k));
	vector<int> t(2*L);
	for(int i = 0; i < k; i++) t[i+L] = (num_even[i]? 0 : 1);
	for(int i = L-1; i; i--) t[i] = (t[2*i]+t[2*i+1])%2;
	cout << (t[1]?"odd":"even") << "\n";
	while(m--){
		int x, y;
		cin >> x >> y;
		x--;
		y %= 2;
		int c = 0;
		if(a[x] && !y) c = 1;
		if(!a[x] && y) c = -1;
		num_even[idx[x]] += c;
		int d = idx[x]+L;
		if(num_even[idx[x]]) t[d] = 0;
		else t[d] = 1;
		d /= 2;
		while(d) t[d] = (t[2*d]+t[2*d+1])%2, d /= 2;
		cout << (t[1]?"odd":"even") << "\n";
	}
}