Problem:
Score : 200 points

Problem Statement

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.

Notes

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 < M and a_1 = b_1, a_2 = b_2, ..., a_N = b_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.

For example, xy < xya and atcoder < atlas.

Constraints

The lengths of s and t are between 1 and 100 (inclusive).

s and t consists of lowercase English letters.

Input

Input is given from Standard Input in the following format:

s
t

Output

If it is possible to satisfy s' < t', print Yes; if it is not, print No.

Sample Input 1

yx
axy

Sample Output 1

Yes

We can, for example, rearrange yx into xy and axy into yxa. Then, xy < yxa.

Sample Input 2

ratcode
atlas

Sample Output 2

Yes

We can, for example, rearrange ratcode into acdeort and atlas into tslaa. Then, acdeort < tslaa.

Sample Input 3

cd
abc

Sample Output 3

No

No matter how we rearrange cd and abc, we cannot achieve our objective.

Sample Input 4

w
ww

Sample Output 4

Yes

Sample Input 5

zzz
zzz

Sample Output 5

No

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include <bits/stdc++.h>
using namespace std;

int sort(string &text){
  bool isend = true;

  while(isend){
    bool swap = false;
    for (int i = 0; i < text.size() -1 ; i++){
      char a0 = text.at(i);
      char a1 = text.at(i + 1); 
  
      if (a0 > a1){
        text.at(i) = a1;
        text.at(i + 1) = a0;
        swap = true;
      }
    }
    if (swap){
      isend = true;
    }
    else{
      isend = false;
    }
  }
}

int sortr(string &text){
  bool isend = true;

  while(isend){
    bool swap = false;
    for (int i = 0; i < text.size() -1 ; i++){
      char a0 = text.at(i);
      char a1 = text.at(i + 1); 
  
      if (a0 < a1){
        text.at(i) = a1;
        text.at(i + 1) = a0;
        swap = true;
      }
    }
    if (swap){
      isend = true;
    }
    else{
      isend = false;
    }
  }
}


bool cond1(string s, string t){
  bool james = false;
  
  if(s.size() < t.size()){
    james = true;
  }
  else{
    return james;
  }
 
  for (int i = 0; i < s.size(); i++){
    if (s.at(i) == t.at(i)){
      james = true;
    }
    else{
      james = false;
    }
  }
  return james; 
}


bool cond2(string s, string t){
  bool james = false;
  int a;
  for (int i = 0; i < min(s.size(), t.size()); i++){
    if(s.at(i) != t.at(i)){
      a = i;
      break;
    }
  }
  if(s.at(a) < t.at(a)){
    james = true;
    return james;
  }
  else{
    return james;
  }
}


int main() {
  string x, y;
  cin >> x >> y;
  sort(x);
  sortr(y);
  
  if (cond1(x, y) || cond2(x, y)){
    cout << "Yes" << endl;
  }
  else{
    cout << "No" << endl;
  }
}