\begin{problem}{Defense Distance}{standard input}{standard output}{2 seconds}{1024 megabytes}

The NWRRC security server has a final access check for teams that try to submit their solutions to the secret hidden problem.

To pass the check, the team must enter three passwords $s$, $t$, and $u$ that the system will accept. Each password must be a non-empty string consisting of at most $5000$ lowercase English letters.

The rules of the server are public:

\begin{shortitems}
\item The distance between $s$ and $t$ should be equal to $a$.
\item The distance between $s$ and $u$ should be equal to $b$.
\item The distance between $t$ and $u$ should be equal to $c$.
\end{shortitems}

The \textit{distance} between two strings $s_1$ and $s_2$ is the minimum number of single-character operations (insert one character, remove one character, or replace one character) needed to convert string $s_1$ into string $s_2$. This metric is also known as the Levenshtein distance.

The server gives access to the hidden problem if and only if all described conditions are satisfied. Your goal is to construct a triple of passwords to unlock the hidden problem or determine that it is impossible.

\InputFile
The only line contains three integers $a$, $b$, and $c$, denoting the required distances between each pair of passwords ($0 \le a, b, c \le 1000$).

\OutputFile
If there are no three passwords with the required properties, print ``\texttt{No}'' in the only line.

Otherwise, print ``\texttt{Yes}'' in the first line. Then print passwords $s$, $t$, and $u$ in the following three lines. Each password should consist of at least $1$ and at most $5000$ lowercase English letters.

If there are multiple triples of passwords that meet the requirements, print any of them.

\Examples

\begin{example}
\exmpfile{example.01}{example.01.a}%
\exmpfile{example.02}{example.02.a}%
\exmpfile{example.03}{example.03.a}%
\end{example}

\Note
In the first test case:

\begin{shortitems}
\item The distance between ``\texttt{icpc}'' and ``\texttt{nwrrc}'' is $4$: ``\texttt{icpc}'' $\to$ ``\texttt{irpc}'' $\to$ ``\texttt{irrc}'' $\to$ ``\texttt{nrrc}'' $\to$ ``\texttt{nwrrc}''.
\item The distance between ``\texttt{icpc}'' and ``\texttt{itmo}'' is $3$: ``\texttt{icpc}'' $\to$ ``\texttt{itpc}'' $\to$ ``\texttt{itpo}'' $\to$ ``\texttt{itmo}''.
\item The distance between ``\texttt{nwrrc}'' and ``\texttt{itmo}'' is $5$: ``\texttt{nwrrc}'' $\to$ ``\texttt{wrrc}'' $\to$ ``\texttt{wrro}'' $\to$ ``\texttt{irro}'' $\to$ ``\texttt{itro}'' $\to$ ``\texttt{itmo}''.
\end{shortitems}

In the second test case, the distance between each pair of passwords is $2$.

In the third test case, it can be shown that there are no three passwords with the required properties.

\end{problem}

