{"raw_statement":[{"iden":"problem statement","content":"A string $T$ of length $3$ consisting of uppercase English letters is an **airport code** for a string $S$ of lowercase English letters if and only if $T$ can be derived from $S$ by one of the following methods:\n\n*   Take a subsequence of length $3$ from $S$ (not necessarily contiguous) and convert it to uppercase letters to form $T$.\n*   Take a subsequence of length $2$ from $S$ (not necessarily contiguous), convert it to uppercase letters, and append `X` to the end to form $T$.\n\nGiven strings $S$ and $T$, determine if $T$ is an airport code for $S$."},{"iden":"constraints","content":"*   $S$ is a string of lowercase English letters with a length between $3$ and $10^5$, inclusive.\n*   $T$ is a string of uppercase English letters with a length of $3$."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$S$\n$T$"},{"iden":"sample input 1","content":"narita\nNRT"},{"iden":"sample output 1","content":"Yes\n\nThe subsequence `nrt` of `narita`, when converted to uppercase, forms the string `NRT`, which is an airport code for `narita`."},{"iden":"sample input 2","content":"losangeles\nLAX"},{"iden":"sample output 2","content":"Yes\n\nThe subsequence `la` of `losangeles`, when converted to uppercase and appended with `X`, forms the string `LAX`, which is an airport code for `losangeles`."},{"iden":"sample input 3","content":"snuke\nRNG"},{"iden":"sample output 3","content":"No"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}