Find the sortable years The year 2013 had an interesting property: the digits are consecutive when sorted (0123). Let's call this type of number a sortable number: a non-negative integer whose base-10 digits are consecutive after sorting. Unfortunately, this won't happen again until 2031, and after that, not until 2103. Your challenge is to write a program or function that, when given a non-negative integer through any standard method, outputs or returns the next sortable number.

Rules


Input and output must be in base 10.
Output may be in any reasonable format (number literal, string literal, single-item array, ...).
Your code must produce the proper output within 1 minute for all inputs up to 98764.


Test cases

    0 -&gt; 1
    1 -&gt; 2
    9 -&gt; 10
   10 -&gt; 12
   11 -&gt; 12
   99 -&gt; 102
  233 -&gt; 234
  234 -&gt; 243
  243 -&gt; 312
 2016 -&gt; 2031
 2031 -&gt; 2103
 2103 -&gt; 2130
 2130 -&gt; 2134
 2134 -&gt; 2143
 9876 -&gt; 10234
98764 -&gt; 98765


The sortable numbers form A215014. A list of all entries up to 98765 can be found here.

Scoring

This is code-golf, so the shortest code in bytes wins.
Python 2, 61 bytes

f=lambda n:-~n*(`sorted(`n+1`)`[2::5]in'0123456789')or f(n+1)


Try it online!