```python
def check_last (arr,n,p):
    """
    Checks whether the last element of a given array is even or odd after
    performing an operation p times.

    The problem statement is ambiguous. A common interpretation for such problems is:
    - The "operation" consists of replacing two elements by their sum, reducing the array size by 1.
    - This is repeated until one element remains. This takes n-1 operations.
    - The parity of the final single element is the same as the parity of the sum of the initial array.
    - The parameter 'p' is the number of operations allowed.
    - If p is sufficient to reduce the array to a single element (i.e., p >= n-1), the result is
      determined by the parity of the sum of the initial array.
    - If p is not sufficient (p < n-1), the process does not conclude, and the final state is
      ambiguous. A plausible interpretation for this case is to consider the state of the
      last element of the original, unmodified array.
    """
    if n == 0:
        return "Even"

    if p >= n - 1:
        # The parity of the final single element is the parity of the sum of all elements.
        # This is equivalent to the parity of the count of odd numbers.
        odd_count = 0
        for x in arr:
            if x % 2 != 0:
                odd_count += 1
        
        if odd_count % 2 == 0:
            return "Even"
        else:
            return "Odd"
    else: # p < n - 1
        # The process cannot be completed. The state is ambiguous.
        # We assume the question refers to the last element of the original array.
        if arr[n-1] % 2 == 0:
            return "Even"
        else:
            return "Odd"

```