#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC oprimize("unrol-loops")

#define vec vector
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define int long long

using namespace std;

typedef pair<int, int> pii;

const int inf = 2e18;
int mod = 100000007;


void solve(){
    int n,m;
    cin>>n>>m;
    vector<int> a(n+1);
    vector<int> kol_even(n+1);
    vector<int> ind(n+1);
    cin>>a[1];
    char last;
    cin>>last;
    ind[1]=1;
    if(a[1]%2==0)
        kol_even[1]++;
    for(int i=2;i<=n;i++){
        cin>>a[i];
        if(last=='*')
            ind[i]=ind[i-1];
        else
            ind[i]=i;
        if(i<n)
            cin>>last;
        if(a[i]%2==0)
            kol_even[ind[i]]++;
    }

    int iseven = 0;
    int kol = 0;
    for(int i=1;i<=n;i++){
        if(ind[i]!=i)
            continue;
        else
            if(kol_even[i]==0)
                kol++;
    }
    if(kol%2==0)
        iseven = 1;
    if(iseven)
            cout<<"even"<<endl;
        else
            cout<<"odd"<<endl;

    for(int i=0;i<m;i++){
       /// cout<<"DEB "<<kol_even[2]<<endl;
         int x,y;
         cin>>x>>y;
         if(y%2){
            if(a[x]%2==0){
                a[x]=1;
                kol_even[ind[x]]--;
                if(kol_even[ind[x]]==0)
                    iseven^=1;
            }

         }
         else{
            if(a[x]%2==1){
                a[x]=0;
                kol_even[ind[x]]++;
                if(kol_even[ind[x]]==1)
                    iseven^=1;
            }
         }


        if(iseven)
            cout<<"even"<<endl;
        else
            cout<<"odd"<<endl;

    }


}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int tests = 1;
    while(tests--){
        solve();
    }
}