Problem Description

Given three strings $a$, $b$ and $c$, your mission is to check whether $c$ is the combine string of $a$ and $b$.
A string $c$ is said to be the combine string of $a$ and $b$ if and only if $c$ can be broken into two subsequences, when you read them as a string, one equals to $a$, and the other equals to $b$.
For example, ``adebcf'' is a combine string of ``abc'' and ``def''.

Input

Input file contains several test cases (no more than 20). Process to the end of file.
Each test case contains three strings $a$, $b$ and $c$ (the length of each string is between 1 and 2000).

Output

For each test case, print ``Yes'', if $c$ is a combine string of $a$ and $b$, otherwise print ``No''.

abc
def
adebcf
abc
def
abecdf

Yes
No