Replace Alone Elements

Background

Problem Description

We'll say that an element in an array is "alone" if there are values before and after it, and those values are different from it. Return a version of the given array where every instance of the given value which is alone is replaced by whichever value to its left or right is larger.

Input Format

Input is given from Standard Input in the following format.

The first line contains a string representation of an integer array, with elements space-separated and enclosed in square brackets, followed by an integer $val$. For example: [1 2 3] 2.

Output Format

Output is printed to Standard Output in the following format.

A string representation of the modified array, with elements separated by commas and spaces, enclosed in square brackets.

Sample

[1 2 3] 2

[1, 3, 3]

[1 2 3 2 5 2] 2

[1, 3, 3, 5, 5, 2]

[3 4] 3

[3, 4]

Sample Explanation

Sample 1: For array [1, 2, 3] and value $2$. The element $2$ at index $1$. Its left is $1$, and its right is $3$. Both $1$ and $3$ are different from $2$, so $2$ is alone. $max(1, 3) = 3$. Replace $2$ with $3$. The resulting array is [1, 3, 3].

Sample 2: For array [1, 2, 3, 2, 5, 2] and value $2$.

1. $2$ at index $1$: Left $1$, right $3$. Alone. $max(1, 3) = 3$. Array becomes [1, 3, 3, 2, 5, 2].
2. $2$ at index $3$: Left $3$, right $5$. Alone. $max(3, 5) = 5$. Array becomes [1, 3, 3, 5, 5, 2].
3. $2$ at index $5$: No right element. Not alone. The resulting array is [1, 3, 3, 5, 5, 2].

Sample 3: For array [3, 4] and value $3$. $3$ at index $0$: No left element. Not alone. The resulting array is [3, 4].

Constraints

Time limit is $1$ second and memory limit is $1024$ KiB for each test case.