# print(f'{number_of_integers=} {num_of_subseq=} {operations=} {subseq=}')
class TreeNode:
    def __init__(self, op, l, r):
        self.operation = op
        self.left = l
        self.right = r


i = -1


def get_tree_node(s):
    global i

    index = s.find('+')
    if index != -1:
        return TreeNode('+', get_tree_node(s[:index]), get_tree_node(s[index + 1:]))
    index = s.find('-')
    if index != -1:
        return TreeNode('-', get_tree_node(s[:index]), get_tree_node(s[index + 1:]))
    index = s.find('*')
    if index != -1:
        return TreeNode('*', get_tree_node(s[:index]), get_tree_node(s[index + 1:]))

    i += 1
    return i


def evaluate_tree(tree, nums):
    if isinstance(tree, int):
        return nums[tree] % 2
    left_value = evaluate_tree(tree.left, nums)
    right_value = evaluate_tree(tree.right, nums)
    if tree.operation == '+':
        return (left_value + right_value) % 2
    if tree.operation == '-':
        return (left_value + right_value) % 2
    if tree.operation == '*':
        return (left_value * right_value) % 2



number_of_integers, num_of_subseq = [int(i) for i in input().split(' ')]
input_str = input().replace(' ', '')
nums_str = input_str.replace("+", ' ').replace("-", ' ').replace("*", ' ')
nums = [int(i) for i in nums_str.split()]
tree = get_tree_node(input_str)
eval = evaluate_tree(tree, nums)
print('odd' if eval == 1 else 'even')
for _ in range(num_of_subseq):
    izm = [int(i) for i in input().split()]
    nums[izm[0]-1] = izm[1]
    eval = evaluate_tree(tree, nums)
    print('odd' if eval == 1 else 'even')