atcoder#ABC279B. [ABC279B] LOOKUP

[ABC279B] LOOKUP

Score : 200200 points

Problem Statement

You are given strings SS and TT consisting of lowercase English letters. Determine whether TT is a (contiguous) substring of SS.

A string YY is said to be a (contiguous) substring of XX if and only if YY can be obtained by performing the operation below on XX zero or more times.

  • Do one of the following.- Delete the first character in XX.
    • Delete the last character in XX.
  • Delete the first character in XX.
  • Delete the last character in XX.

For instance, tag is a (contiguous) substring of voltage, while ace is not a (contiguous) substring of atcoder.

Constraints

  • SS and TT consist of lowercase English letters.
  • 1S,T1001 \le |S|,|T| \le 100 (X|X| denotes the length of a string XX.)

Input

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

SS

TT

Output

If TT is a (contiguous) substring of SS, print Yes; otherwise, print No.

voltage
tag
Yes

tag is a (contiguous) substring of voltage.

atcoder
ace
No

ace is not a (contiguous) substring of atcoder.

gorilla
gorillagorillagorilla
No
toyotasystems
toyotasystems
Yes

It is possible that S=TS=T.