3395: G.String Transformation

Bobo has a string S = s1s2 . . . sn consists of letter a, b and c. He can transform the string by inserting or deleting substrings aa, bb and abab.

Formally, A = u ◦ w ◦ v (“◦” denotes string concatenation) can be transformed into A0 = u ◦ v and vice versa where u, v are (possibly empty) strings and w {aa, bb, abab}.

Given the target string T = t₁t₂ . . . t_m, determine if Bobo can transform the string S into T .

The input consists of several test cases and is terminated by end-of-file.

The first line of each test case contains a string s₁s₂ . . . s_n. The second line contains a string t₁t₂ . . . t_m.

For each test case, print Yes if Bobo can. Print No otherwise.

Constraint

• 1 ≤ n, m ≤ 10⁴

• s₁, s₂, . . . , s_n, t₁, t₂, . . . , t_m   {a, b, c}

ab
ba
ac
ca
a
ab

Yes
No
No