Cossack Vus has exactly pies and friends.
It is known that each of his friends wants exactly three pies.
Cossack Vus does not let his friends down, so he will give each of them what they want.
Determine how many pies will be left with Cossack Vus after he gives three pies to each friend. It is known that Vus has enough pies.
The first line contains one integer (3 \leq n \leq 100) — the number of pies.
The second line contains one integer (1 \leq m \leq 100) — the number of Cossack Vus's friends.
It is guaranteed that Vus will have enough pies to distribute to all his friends.
Output one integer — the number of pies that will remain with Cossack Vus after he gives them to his friends.
Example 1
Cossack has two friends, to each of whom he will give three pies. In total, he will give away six, so only four pies will remain.