Wrong Subtraction CodeForces - 977A （水题）

A. Wrong Subtraction

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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次操作，如果这个数最后一位不为0，那么这个数减1，如果为0，那么这个数除10

#include "iostream"
using namespace std;
int main()
{
    int n,m;
    cin>>n>>m;
    while(m){
        if(n%10!=0) n-=1;
        else n/=10;
        m--;
    }
    cout<<n<<endl;
    return 0;
}