You are given two strings \(A\) and \(B\). You want to check whether it is possible to create string \(A\) from string \(B\) by inserting characters into string \(B\) without changing the order of the existing characters.
The first line will contain the string \(A\ (1 \le |A| \le 10^5)\).
The second line will contain the string \(B\ (1 \le |B| \le |A|)\).
It is guaranteed \(A\) and \(B\) will only contain lowercase latin characters.
YES if it is possible, and
For 5/15 points, \(|A| \le 100\).