该比赛已结束，您无法在比赛模式下递交该题目。您可以点击“在题库中打开”以普通模式查看和递交本题。

Problem Statement

You are given two strings $S$ and $T$ consisting of lowercase English letters.

Determine if there exists a pair of integers $c$ and $w$ such that $1 \le c \le w < |S|$and the following condition is satisfied. Here, $|S|$ denotes the length of the string $S$. Note that $w$ must be less than $|S|$.

• If $S$ is split at every $w$ characters from the beginning, the concatenation of the $c$-th characters of the substrings of length at least $c$ in order equals $T$.

Constraints

• $S$ and $T$ are strings consisting of lowercase English letters.
• $1 \le |T| \le |S| \le 100$

Input

The input is given from Standard Input in the following format:

S T

Output

Print Yes if there exists a pair of integers $c$ and $w$ such that $1 \le c \le w < |S|$ and the condition is satisfied, and No otherwise.

Sample

atcoder toe

Yes

If $S$ is split at every two characters, it looks like this:

at
co
de
r

Then, the concatenation of the 2nd characters of the substrings of length at least $2$ is toe, which equals $T$. Thus, print Yes.

beginner r

No

$w=|S|$ is not allowed, and no pair of integers $1 \le c \le w < |S|$ satisfies the condition. Thus, print No.

verticalreading agh

No