#include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
using namespace std;

int main(){
	string s,t;
	cin>>s>>t;
	sort(all(s));
	sort(all(t));
	reverse(all(t));
	if(s.compare(t)<0) cout<<"Yes";
	else cout<<"No";
}
### Prompt

Develop a solution in cpp to the problem described below:

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.

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`.

Examples

Input

yx
axy


Output

Yes


Input

ratcode
atlas


Output

Yes


Input

cd
abc


Output

No


Input

w
ww


Output

Yes


Input

zzz
zzz


Output

No

### Response

```cpp
#include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
using namespace std;

int main(){
	string s,t;
	cin>>s>>t;
	sort(all(s));
	sort(all(t));
	reverse(all(t));
	if(s.compare(t)<0) cout<<"Yes";
	else cout<<"No";
}
```