{"problem":{"name":"Airport Code","description":{"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 followi","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc349_c"},"statements":[{"statement_type":"Markdown","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$.\n\n## Constraints\n\n*   $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$.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$S$\n$T$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc349_c","tags":[],"sample_group":[["narita\nNRT","Yes\n\nThe subsequence `nrt` of `narita`, when converted to uppercase, forms the string `NRT`, which is an airport code for `narita`."],["losangeles\nLAX","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`."],["snuke\nRNG","No"]],"created_at":"2026-03-03 11:01:14"}}