Background

说好的出两题就出两题……

Description

Given integers x y z, print the (x+y)mod z

Format

Input

Three integers x , y ,z , satisfying 2 <= x, y,z <= 2^64-1.

Output

One integer, x+y mod z

Sample 1

Input

123 500 10000000

Output

623

Limitation

1s, 1024KiB for each test case.

Source

Vijos Original