#P1228A. Distinct Digits

    ID: 4984 Type: RemoteJudge 1000ms 256MiB Tried: 0 Accepted: 0 Difficulty: (None) Uploaded By: Tags>brute forceimplementation*800

Distinct Digits

No submission language available for this problem.

Description

You have two integers $l$ and $r$. Find an integer $x$ which satisfies the conditions below:

  • $l \le x \le r$.
  • All digits of $x$ are different.

If there are multiple answers, print any of them.

The first line contains two integers $l$ and $r$ ($1 \le l \le r \le 10^{5}$).

If an answer exists, print any of them. Otherwise, print $-1$.

Input

The first line contains two integers $l$ and $r$ ($1 \le l \le r \le 10^{5}$).

Output

If an answer exists, print any of them. Otherwise, print $-1$.

Samples

121 130
123
98766 100000
-1

Note

In the first example, $123$ is one of the possible answers. However, $121$ can't be the answer, because there are multiple $1$s on different digits.

In the second example, there is no valid answer.