- Time limit: 1.00 s
- Memory limit: 512 MB
Maija is on a deadline and she is frantically writing an essay. She notices that she has made a typo, but to her horror she realizes that her backspace key is broken. There is no time to start fixing the keyboard, so Maija has to fix her text by adding more letters. In her mind, text s is what she wants to write while text t is what she currently has. Figure out whether Maija can still fix her essay by typing more characters to her text. Note that she can insert the characters anywhere in the text.
Input
The first line and the second line contain a single string s and t, respectively.
Output
Print "Yes" if it is possible to obtain text s by inserting zero or more characters to text t and "No" otherwise.
Constraints
- s and t only contain lowercase Latin letters
- 1 \leq |t|, |s| \leq 2 \times 10^5
Example 1
Input:
ithinktheromanemperormaximusminimuswasperttymedium ithinktheromanemperormaximusminisum
Output:
Yes
Example 2
Input:
a aa
Output:
No
Example 3
Input:
abcd e
Output:
No