该比赛已结束，您无法在比赛模式下递交该题目。您可以点击“在题库中打开”以普通模式查看和递交本题。

Problem Statement

A string $T$ of length $3$ consisting of uppercase English letters is an airport code for a string $S$ of lowercase English letters if and only if $T$ can be derived from $S$ by one of the following methods:

1. Take a subsequence of length $3$ from $S$ (not necessarily contiguous) and convert it to uppercase letters to form $T$.
2. Take a subsequence of length $2$ from $S$ (not necessarily contiguous), convert it to uppercase letters, and append $X$ to the end to form $T$.

Given strings $S$ and $T$, determine if $T$ is an airport code for $S$.

Constraints

• $S$ is a string of lowercase English letters with a length between $3$ and $10^5$, inclusive.
• $T$ is a string of uppercase English letters with a length of $3$.

Input

The input is provided in the following format:

S
T

Output

Print Yes if $T$ is an airport code for $S$, and No otherwise.

Example

narita
NRT

Yes

The subsequence nrt of narita, when converted to uppercase, forms the string NRT, which is an airport code for narita.

losangeles
LAX

Yes

The subsequence la of losangeles, when converted to uppercase and appended with X, forms the string LAX, which is an airport code for losangeles.

snuke
RNG

No