CF659A.Round House
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Vasya 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.
Illustration for n=6 , a=2 , b=−5 .Help Vasya to determine the number of the entrance, near which he will be at the end of his walk.
输入格式
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.
输出格式
Print a single integer k ( 1<=k<=n ) — the number of the entrance where Vasya will be at the end of his walk.
输入输出样例
输入#1
6 2 -5
输出#1
3
输入#2
5 1 3
输出#2
4
输入#3
3 2 7
输出#3
3
说明/提示
The first example is illustrated by the picture in the statements.