Codeforces Round 346 (Div. 2) |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only 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.

implementation

math

*1000

No tag edit access

The problem statement has recently been changed. View the changes.

×
A. Round House

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputVasya lives in a round building, whose entrances are numbered sequentially by integers from 1 to *n*. Entrance *n* and entrance 1 are adjacent.

Today Vasya got bored and decided to take a walk in the yard. Vasya lives in entrance *a* and he decided that during his walk he will move around the house *b* entrances in the direction of increasing numbers (in this order entrance *n* should be followed by entrance 1). The negative value of *b* corresponds to moving |*b*| entrances in the order of decreasing numbers (in this order entrance 1 is followed by entrance *n*). If *b* = 0, then Vasya prefers to walk beside his entrance.

Help Vasya to determine the number of the entrance, near which he will be at the end of his walk.

Input

The single line of the input contains three space-separated integers *n*, *a* and *b* (1 ≤ *n* ≤ 100, 1 ≤ *a* ≤ *n*, - 100 ≤ *b* ≤ 100) — the number of entrances at Vasya's place, the number of his entrance and the length of his walk, respectively.

Output

Print a single integer *k* (1 ≤ *k* ≤ *n*) — the number of the entrance where Vasya will be at the end of his walk.

Examples

Input

6 2 -5

Output

3

Input

5 1 3

Output

4

Input

3 2 7

Output

3

Note

The first example is illustrated by the picture in the statements.

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/01/2023 05:22:32 (l3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|