{"problem":{"name":"Lexicographic Order","description":{"content":"You are given two different strings $S$ and $T$.   If $S$ is lexicographically smaller than $T$, print `Yes`; otherwise, print `No`. What is the lexicographical order?Simply speaking, the lexicographi","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc217_a"},"statements":[{"statement_type":"Markdown","content":"You are given two different strings $S$ and $T$.  \nIf $S$ is lexicographically smaller than $T$, print `Yes`; otherwise, print `No`.\nWhat is the lexicographical order?Simply speaking, the lexicographical order is the order in which words are listed in a dictionary. As a more formal definition, here is the algorithm to determine the lexicographical order between different strings $S$ and $T$.\nBelow, let $S_i$ denote the $i$\\-th character of $S$. Also, if $S$ is lexicographically smaller than $T$, we will denote that fact as $S \\lt T$; if $S$ is lexicographically larger than $T$, we will denote that fact as $S \\gt T$.\n\n1.  Let $L$ be the smaller of the lengths of $S$ and $T$. For each $i=1,2,\\dots,L$, we check whether $S_i$ and $T_i$ are the same.\n2.  If there is an $i$ such that $S_i \\neq T_i$, let $j$ be the smallest such $i$. Then, we compare $S_j$ and $T_j$. If $S_j$ comes earlier than $T_j$ in alphabetical order, we determine that $S \\lt T$ and quit; if $S_j$ comes later than $T_j$, we determine that $S \\gt T$ and quit.\n3.  If there is no $i$ such that $S_i \\neq T_i$, we compare the lengths of $S$ and $T$. If $S$ is shorter than $T$, we determine that $S \\lt T$ and quit; if $S$ is longer than $T$, we determine that $S \\gt T$ and quit.\n\nNote that many major programming languages implement lexicographical comparison of strings as operators or functions in standard libraries. For more detail, see your language's reference.\n\n## Constraints\n\n*   $S$ and $T$ are different strings, each of which consists of lowercase English letters and has a length of between $1$ and $10$ (inclusive).\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$S$ $T$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc217_a","tags":[],"sample_group":[["abc atcoder","Yes\n\n`abc` and `atcoder` begin with the same character, but their second characters are different. Since `b` comes earlier than `t` in alphabetical order, we can see that `abc` is lexicographically smaller than `atcoder`."],["arc agc","No"],["a aa","Yes"]],"created_at":"2026-03-03 11:01:14"}}