Takahashi has a string $S$ consisting of lowercase English letters.
On this string, he will do the operation below just once.

• First, choose a non-negative integer $K$.
• Then, shift each character of $S$ to the right by $K$ (see below).

Here,

• a shifted to the right by $1$ is b;
• b shifted to the right by $1$ is c;
• c shifted to the right by $1$ is d;
• $\cdots$
• y shifted to the right by $1$ is z;
• z shifted to the right by $1$ is a.

For example, b shifted to the right by $4$ is f, and y shifted to the right by $3$ is b.
You are given a string $T$. Determine whether Takahashi can make $S$ equal $T$ by the operation above.

Input is given from Standard Input in the following format:
$S$
$T$

If Takahashi can make $S$ equal $T$, print Yes; if not, print No.

Each of $S$ and $T$ is a string of length between $1$ and $10^5$ (inclusive) consisting of lowercase English letters.
The lengths of $S$ and $T$ are equal.

Yes

Yes

Choosing $K=1$.