Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
B. Two Strings

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputA subsequence of length |*x*| of string *s* = *s*_{1}*s*_{2}... *s*_{|s|} (where |*s*| is the length of string *s*) is a string *x* = *s*_{k1}*s*_{k2}... *s*_{k|x|} (1 ≤ *k*_{1} < *k*_{2} < ... < *k*_{|x|} ≤ |*s*|).

You've got two strings — *s* and *t*. Let's consider all subsequences of string *s*, coinciding with string *t*. Is it true that each character of string *s* occurs in at least one of these subsequences? In other words, is it true that for all *i* (1 ≤ *i* ≤ |*s*|), there is such subsequence *x* = *s*_{k1}*s*_{k2}... *s*_{k|x|} of string *s*, that *x* = *t* and for some *j* (1 ≤ *j* ≤ |*x*|) *k*_{j} = *i*.

Input

The first line contains string *s*, the second line contains string *t*. Each line consists only of lowercase English letters. The given strings are non-empty, the length of each string does not exceed 2·10^{5}.

Output

Print "Yes" (without the quotes), if each character of the string *s* occurs in at least one of the described subsequences, or "No" (without the quotes) otherwise.

Examples

Input

abab

ab

Output

Yes

Input

abacaba

aba

Output

No

Input

abc

ba

Output

No

Note

In the first sample string *t* can occur in the string *s* as a subsequence in three ways: abab, abab and abab. In these occurrences each character of string *s* occurs at least once.

In the second sample the 4-th character of the string *s* doesn't occur in any occurrence of string *t*.

In the third sample there is no occurrence of string *t* in string *s*.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/13/2021 16:16:49 (i1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|