Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. Soldier and Bananas

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputA soldier wants to buy *w* bananas in the shop. He has to pay *k* dollars for the first banana, 2*k* dollars for the second one and so on (in other words, he has to pay *i*·*k* dollars for the *i*-th banana).

He has *n* dollars. How many dollars does he have to borrow from his friend soldier to buy *w* bananas?

Input

The first line contains three positive integers *k*, *n*, *w* (1 ≤ *k*, *w* ≤ 1000, 0 ≤ *n* ≤ 10^{9}), the cost of the first banana, initial number of dollars the soldier has and number of bananas he wants.

Output

Output one integer — the amount of dollars that the soldier must borrow from his friend. If he doesn't have to borrow money, output 0.

Examples

Input

3 17 4

Output

13

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/20/2017 13:50:22 (c4).

Desktop version, switch to mobile version.

User lists

Name |
---|