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 left-right order. Write a program to find a solution such that the new number formed by the remaining digits is the smallest possible.
Output the new smallest positive integer. (The length of n does not exceed 240 digits.)
No input data validation is required.

Input Format

n  
s  

Output Format

The smallest remaining number after removing s digits.

175438
4

13