贪婪算法从文件输入一个高精度正整数N，去掉其中任意S个数后剩下的数字按原左右次序将组成一个新的正整数。编程对给定的N和S，寻找一种方案使得剩下的数字组成最小的新数。

输出得到的新正整数

-greedy algorithmEnter a high precision　the file is an integer N, remove any of the number of S after the number of the left and right in order to form a new positive integer. Programming for a given N and S, looking for a solution that makes the number of the remaining number of the smallest number of new.

The new integer output