单点时限: 1.0 sec
内存限制: 256 MB
Given two strings $s$ and $t$, it is possible to swap two adjacent characters in the same string at a time.
Please tell us if it is possible to make $s$ and $t$ the same after several swaps.
If yes, output “YES”, otherwise output “NO”.
Two strings in two lines represent $s$ and $t$ respectively.
A line of “YES” or “NO”.
$1 \le |s|, |t| \le 1000$.