# 1425. All in All

You have devised a new encryption technique which encodes a message by inserting between its characters randomly generated strings in a clever way. Because of pending patent issues we will not discuss in detail how the strings are generated and inserted into the original message. To validate your method, however, it is necessary to write a program that checks if the message is really encoded in the final string.

Given two strings $s$ and $t$, you have to decide whether $s$ is a subsequence of $t$, i.e. if you can remove characters from $t$ such that the concatenation of the remaining characters is $s$.

### 输入格式

The input contains several testcases. Each is specified by two strings $s,\ t$ of alphanumeric ASCII characters separated by whitespace.The length of $s$ and $t$ will be no more than 100000.

### 输出格式

For each test case output Yes, if $s$ is a subsequence of $t$,otherwise output No.

### 样例

Input
sequence subsequence
person compression
VERDI vivaVittorioEmanueleReDiItalia
caseDoesMatter CaseDoesMatter

Output
Yes
No
Yes
No


423 人解决，488 人已尝试。

526 份提交通过，共有 1390 份提交。

1.7 EMB 奖励。