Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
A. Distinct Digits

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou 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.

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

Examples

Input

121 130

Output

123

Input

98766 100000

Output

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

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/13/2021 09:42:42 (h2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|