Score : $200$ points

问题陈述

给定两个由小写英文字母组成的字符串 $S$ 和 $T$。

确定是否存在一对整数 $c$ 和 $w$，使得 $1 \leq c \leq w < |S|$ 并且满足以下条件。这里，$|S|$ 表示字符串 $S$ 的长度。注意 $w$ 必须 小于 $|S|$。

• 如果从字符串 $S$ 的开头每 $w$ 个字符分割一次，那么长度至少为 $c$ 的子串的第 $c$ 个字符按顺序连接起来等于 $T$。

以上为大语言模型 kimi 翻译，仅供参考。

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 \leq c \leq 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 \leq |T|$ $\leq$ $|S| \leq 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 \leq c \leq w < |S|$ and the condition is satisfied, and No otherwise.

Sample Input 1

atcoder toe

Sample Output 1

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.

Sample Input 2

beginner r

Sample Output 2

No

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

Sample Input 3

verticalreading agh

Sample Output 3

No