{"raw_statement":[{"iden":"problem statement","content":"You are given strings $S$ and $T$ consisting of lowercase English letters. Determine whether $T$ is a (contiguous) substring of $S$.\nA string $Y$ is said to be a (contiguous) substring of $X$ if and only if $Y$ can be obtained by performing the operation below on $X$ zero or more times.\n\n*   Do one of the following.\n    *   Delete the first character in $X$.\n    *   Delete the last character in $X$.\n\nFor instance, `tag` is a (contiguous) substring of `voltage`, while `ace` is not a (contiguous) substring of `atcoder`."},{"iden":"constraints","content":"*   $S$ and $T$ consist of lowercase English letters.\n*   $1 \\le |S|,|T| \\le 100$ ($|X|$ denotes the length of a string $X$.)"},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$S$\n$T$"},{"iden":"sample input 1","content":"voltage\ntag"},{"iden":"sample output 1","content":"Yes\n\n`tag` is a (contiguous) substring of `voltage`."},{"iden":"sample input 2","content":"atcoder\nace"},{"iden":"sample output 2","content":"No\n\n`ace` is not a (contiguous) substring of `atcoder`."},{"iden":"sample input 3","content":"gorilla\ngorillagorillagorilla"},{"iden":"sample output 3","content":"No"},{"iden":"sample input 4","content":"toyotasystems\ntoyotasystems"},{"iden":"sample output 4","content":"Yes\n\nIt is possible that $S=T$."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}