Two employees of a well-known company, Alice and Bob, have proposed their solutions to a critical bug that occurred. Now Alice suspects that Bob simply took her code and added non-functional characters to create the impression of more intensive work.
The company writes code in an esoteric programming language similar to Malbolge, so each employee's code is represented as a string of lowercase Latin letters. Alice's code is represented by the string $$$t$$$, and Bob's code is represented by the string $$$s$$$.
Since Bob's keyboard is broken, he can only type exactly two characters at a time, meaning he can insert any two (not necessarily identical) characters into any position in the string. After Alice expressed her suspicion of Bob's plagiarism, their team leader started analyzing the strings $$$s$$$ and $$$t$$$ to determine if Bob could have obtained string $$$s$$$ from string $$$t$$$ using his broken keyboard. To do this, he tries to gradually remove pairs of adjacent characters from string $$$s$$$ until he obtains string $$$t$$$.
Help determine if Bob is guilty of plagiarism: determine if it is possible to obtain string $$$t$$$ from string $$$s$$$ by removing pairs of adjacent characters any number of times.
The first line contains a string $$$s$$$ consisting of lowercase Latin letters from 'a' to 'z' ($$$1 \le |s| \le 2 \cdot 10^5$$$).
The second line contains a string $$$t$$$, also consisting of lowercase Latin letters ($$$1 \le |t| \le |s|$$$).
Output «YES» if string $$$t$$$ can be obtained from string $$$s$$$ by removing pairs of adjacent characters, and «NO» otherwise.
Points are awarded for each subtask only if all tests of that subtask and the necessary subtasks are passed.
| Subtask | Points | Additional Constraints | Necessary Subtasks | Test Case Information |
| 1 | 20 | $$$|s| \le 10$$$ | full | |
| 2 | 23 | $$$t$$$ consists only of 'a' | first error | |
| 3 | 27 | $$$|s| \le 1000$$$; $$$|t| = |s| - 2$$$ | first error | |
| 4 | 30 | none | 1 – 3 | first error |
sobaka baka
YES
sobabka baka
NO
abacaba aca
YES
| Name |
|---|


