G

Problem description

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$

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

Input

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

Output

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

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

Examples

Input

512 4

Output

Input

1000000000 9

Output

Note

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

$512 \to 511 \to 510 \to 51 \to 50$

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 int main()
 4 {
 5     int n,k;
 6     cin>>n>>k;
 7     for(int i=1;i<=k;++i){
 8         if(n%10)n-=1;
 9         else n/=10;
10     }
11     cout<<n<<endl;
12     return 0;
13 }