One panda named orz is playing a interesting game, he gets a big integer* Num* and an integer *K*. In this game, he can exchange two single numbers in *Num*. For example, he can get 1243 from 3241 by exchange 1 and 3.But orz can exchange at most *K* times. So what’s the biggest number after at most* K* times operations?

However, a VIP (Very Important Panda) of ACM/OPPC (Orz Panda Programming Contest) comittee thought this problem was too hard for Orz Pandas. So he simplified this problem with constraint **K=1**. Your task is to solve the simplified problem.