Description

Given a high-precision positive integer $n$, remove any $s$ digits from it, and form a new positive integer with the remaining digits in their original order. Write a program to find a solution that makes the new number as small as possible for given $n$ and $s$.
Output the new positive integer. ($n$ has at most $240$ digits)
No error checking is required for the input data.

Input Format

The input consists of two lines. The first line contains $n$, and the second line contains $s$.

Output Format

The smallest possible number after removing $s$ digits.

Sample

175438
4

13