{"raw_statement":[{"iden":"problem statement","content":"You are given strings $s$ and $t$, consisting of lowercase English letters. You will create a string $s'$ by freely rearranging the characters in $s$. You will also create a string $t'$ by freely rearranging the characters in $t$. Determine whether it is possible to satisfy $s' < t'$ for the lexicographic order."},{"iden":"notes","content":"For a string $a = a_1 a_2 ... a_N$ of length $N$ and a string $b = b_1 b_2 ... b_M$ of length $M$, we say $a < b$ for the lexicographic order if either one of the following two conditions holds true:\n\n*   $N < M$ and $a_1 = b_1$, $a_2 = b_2$, ..., $a_N = b_N$.\n*   There exists $i$ ($1 \\leq i \\leq N, M$) such that $a_1 = b_1$, $a_2 = b_2$, ..., $a_{i - 1} = b_{i - 1}$ and $a_i < b_i$. Here, letters are compared using alphabetical order.\n\nFor example, `xy` $<$ `xya` and `atcoder` $<$ `atlas`."},{"iden":"constraints","content":"*   The lengths of $s$ and $t$ are between $1$ and $100$ (inclusive).\n*   $s$ and $t$ consists of lowercase English letters."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$s$\n$t$"},{"iden":"sample input 1","content":"yx\naxy"},{"iden":"sample output 1","content":"Yes\n\nWe can, for example, rearrange `yx` into `xy` and `axy` into `yxa`. Then, `xy` $<$ `yxa`."},{"iden":"sample input 2","content":"ratcode\natlas"},{"iden":"sample output 2","content":"Yes\n\nWe can, for example, rearrange `ratcode` into `acdeort` and `atlas` into `tslaa`. Then, `acdeort` $<$ `tslaa`."},{"iden":"sample input 3","content":"cd\nabc"},{"iden":"sample output 3","content":"No\n\nNo matter how we rearrange `cd` and `abc`, we cannot achieve our objective."},{"iden":"sample input 4","content":"w\nww"},{"iden":"sample output 4","content":"Yes"},{"iden":"sample input 5","content":"zzz\nzzz"},{"iden":"sample output 5","content":"No"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}