Subsequence

Interview

Time limit1sMemory limit128 MB

Summary

For each line of input, decide whether the first string is a subsequence of the second, printing Yes or No.

Level: Easy3 of 10
Topics: Two pointers, String, Greedy, Implementation
Solved: No attempts yet

Problem

You are given two strings $s$ and $t$ . Write a program that decides whether $s$ is a subsequence of $t$ . Here, $s$ is a subsequence of $t$ if you can delete some characters of $t$ and concatenate the remaining characters, without reordering them, to obtain $s$ . In other words, every character of $s$ appears in $t$ in the same relative order (they need not be contiguous).

Input

The input consists of several test cases. Each test case is a single line containing two strings $s$ and $t$ separated by a single space. Each string has length at most 100,000. The input continues until end of file (EOF).

Output

For each test case, print Yes on its own line if $s$ is a subsequence of $t$ , and No otherwise.

Examples1

Example 1

Input

sequence subsequence
person compression
VERDI vivaVittorioEmanueleReDiItalia
caseDoesMatter CaseDoesMatter

Expected output

Yes
No
Yes
No