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

// #define int long long
#define fo(i,b) for(int i = (0); i < (b); ++i)
#define f(i,a,b) for(int i = (a); i < (b); ++i)
#define rep(i,a,b) for(int i = (a); i < (b); ++i)
typedef pair<int, int> pii;
typedef vector<int> vi;

const int NMAX = 112345;

int inn[NMAX];
char ino[NMAX];

int ps[NMAX];

int scount[NMAX];
int lparts;

#define D if(0)


signed main() {
	int n,m;
	scanf("%d%d", &n, &m);
	fo(i,n-1) scanf("%d %c", inn+i, ino+i);
	scanf("%d", inn+n-1);

	fo(i,n-1)
	{
		if(ino[i]=='*') ps[i+1] = ps[i];
		else ps[i+1] = i+1;
	}
	fo(i,n) scount[ps[i]] += inn[i]%2==0;
	fo(i,n) if(ps[i]==i) lparts += scount[i]==0;

	printf("%s\n", lparts%2?"odd":"even");
	fo(i,m){
		int x,y;
		scanf("%d%d", &x, &y);
		x--;
		if(inn[x]%2==0)
		{
			scount[ps[x]]--;
			if(!scount[ps[x]]) lparts++;
		}
		inn[x] = y;
		if(inn[x]%2==0)
		{
			if(!scount[ps[x]]) lparts--;
			scount[ps[x]]++;
		}
		D fo(i,n) printf("%d %d %d\n", i, ps[i], scount[i]);
		printf("%s\n", lparts%2?"odd":"even");
	}

}