Training Site

# Vandal

Input: Standard Input (stdin)
Output: Standard Output (stdout)
Memory limit: 10 megabytes
Time limit: 1.0 seconds

Vincent the Vandal's favourite hobby is defacing signs. Every night he roams the streets, searching for signs to make his mark on.

He carries with him a permanent marker, which he uses to scribble over and erase some of the characters in a sign. This changes the writing on a sign from something boring and pedestrian to something witty and thought provoking.

For example, Vincent could see a sign reading STAY OFF THE GRASS MATE and remove some characters so that it said YO HE GRATE.

Not being the best at spelling, Vincent would like to check whether it's possible to erase characters on the sign to spell out his chosen phrase.

More formally, given a string $S$ representing text on a sign, and a string $D$ of length $N$ representing Vincent's desired phrase, Vincent would like to know whether it's possible to choose some indices $K_0, K_1, ... K_{N-1}$ such that $K_{i} < K_{i+1}$ and $S_{K_i} = D_i$ for all $i$. If that sounds complicated, have a look at the example below.

## Input

The input will consist of the two strings $S$ and $D$ separated by a newline.

$S$ and $D$ will consist entirely of capital ASCII letters and spaces.

Each string will contain at least 1 and at most 10,000 characters.

## Output

The output should be the string YES if it is possible for Vincent to create his chosen string, or NO if it is impossible.

• ### Sample Input 1

STAY OFF THE GRASS MATE
YO HE GRATE


### Sample Output 1

YES

• ### Sample Input 2

STAY OFF THE GRASS MATE
YO HE GRATEX


### Sample Output 2

NO