977A Wrong Subtraction(模拟)

Little girl Tanya is learning how to decrease a number by one, but she does it wrong with a number consisting of two or more digits. Tanya subtracts one from a number by the following algorithm:

• if the last digit of the number is non-zero, she decreases the number by one;
• if the last digit of the number is zero, she divides the number by 10 (i.e. removes the last digit).

You are given an integer number $n$

. Tanya will subtract one from it $k$ times. Your task is to print the result after all $k$

subtractions.

It is guaranteed that the result will be positive integer number.

Input

The first line of the input contains two integer numbers $n$

and $k$ ( $2\le n\le {10}^9$, $1\le k\le 50$

) — the number from which Tanya will subtract and the number of subtractions correspondingly.

Output

Print one integer number — the result of the decreasing $n$

by one $k$

times.

It is guaranteed that the result will be positive integer number.

Examples

Input

Copy

512 4

Output

Copy

50

Input

Copy

1000000000 9

Output

Copy

1

Note

The first example corresponds to the following sequence: $512\to 511\to 510\to 51\to 50$

.题意：给一个数字n和m，如果n的最后一位是0，则n=n/10，否则n=n-1,求操作m次后n的数值

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m;
	cin>>n>>m;
	for(int i=0;i<m;i++){
		if(n%10==0) n/=10;
		else n--;
	}
	printf("%d\n",n);
	return 0;
}