Shops
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Today is Friday. Anton is finally free from school for two days! Anton can go home in two ways:

- by taking the first path, Anton can visit $$$a$$$ shops;
- by taking the second path, Anton can visit $$$b$$$ shops.

Anton also knows that there are $$$c$$$ shops that are encountered on both paths (in both places). Anton is curious about how many shops are there in his city in total? Let's assume that there are no more shops in the city except for these shops.

Help him answer this question.

Above is one of the possible route options in the second example.

Input

The first line contains three integers $$$a$$$, $$$b$$$, $$$c$$$ ($$$0 \le c \le a, b \le 100$$$) — the number of shops on the first path, the second path, and on both.

Output

Print a single integer — the total number of shops in the city.

Examples

Input

    1 2 0

Output

    3

Input

    9 6 3

Output

    12