Champernowne up to me Inspired by this question.

Champernowne's constant is an infinite decimal number that consists of "0." followed by all natural numbers concatenated together.  It begins like so: 0.123456781011121314151617181920212223242526272829303132333435363738394041424344454647484950, etc. The digits of Chamernowne's constant are sequence A033307 in the OEIS.  

Your Task:

Write a program or function that, when given an integer as input, outputs/returns Champernowne's constant up to the first occurance of the input.  For example, if the input is 13, you should output 0.12345678910111213.  If you wish, for inputs greater than 0, you may drop the leading "0." in your output.  

Input:

An integer, or a string containing only numbers.  

Output:

Champernowne's constant up to the first occurance of the input.  

Test Cases:

0   -&gt; 0
1   -&gt; 0.1 OR 1
14  -&gt; 0.1234567891011121314 OR 1234567891011121314
91  -&gt; 0.1234567891 OR 1234567891
12  -&gt; 0.12 OR 12
101 -&gt; 0.123456789101 OR 123456789101 


Scoring:

This is code-golf, lowest score in bytes wins!
05AB1E, 6 bytes

Code

LJ¹¡н«


Uses the 05AB1E encoding. Try it online!

Explanation

L         # Create the range [1, 2, ..., input]
 J        # Join into a single string
  ¹¡      # Split at occurences of the input
    н     # Take the first element
     «    # Append the input to the first element and implicitly output