Bad Checker Detected#12823

Bad Checker Detected

1 second
512 megabytes
Medium

On a well known Contest Management System the following task was found:

"Consider a six-digit integer lucky if the sum of three leftmost digits in it is equal to the sum of three rightmost digits. Given a six-digit integer such as L \le X \le R, find the lucky integer nearest to (if is lucky, you shall consider the itself). Note that answer may be outside interval"

The checker accepted the answer from a participant only when it is equal to the answer generated by the model solution. Given and determine if this checker works correctly (assuming that the model solution is correct), or if there exists some where two or more correct answers are possible, print least such .

Input

The first line contains two integers and (100\,000 \le L \le R \le 999\,999) — left and right limits for in the problem.

Output

If the checker works correctly for all L \le X \le R, print . Otherwise, print the minimal possible such as there is more than one correct answer for the given .

Examples

Example 1

Loading
Loading

Example 2

Loading
Loading