Array Modification

Background

Congcong is processing some number sequences. He discovered a special rule that requires adjustments to certain sequences.

Problem Description

Given an integer array of length $3$. If there is a $2$ in the array immediately followed by a $3$, set the $3$ element to $0$. Return the changed array.

Input Format

Input is given from standard input in the following format.

A single line containing three integers, representing the elements of the array.

Output Format

Output is printed to standard output in the following format.

A single line containing three integers, representing the modified array.

Sample

[1 2 3]

[1, 2, 0]

[2 3 5]

[2, 0, 5]

[1 2 1]

[1, 2, 1]

Sample Explanation

In the first sample, a $2$ at index $1$ is immediately followed by a $3$ at index $2$, so the $3$ at index $2$ is changed to $0$. In the second sample, a $2$ at index $0$ is immediately followed by a $3$ at index $1$, so the $3$ at index $1$ is changed to $0$. In the third sample, there is no $2$ immediately followed by a $3$, so the array remains unchanged.

Constraints

Time limit: $1$s, Memory limit: $1024$KiB for each test case.