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.
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
Copy
6 2 -5
output
3
input
Copy
5 1 3
output
4
input
Copy
3 2 7
output
3
Note
The first example is illustrated by the picture in the statements.
一道模拟题,意思就是给你一个圈,给你一个起点,给你走的步数,-代表逆时针,正数就是逆时针,WA了好几次,总是没能完整的写出来关系,其实思路很简单,把步数取余就好了,逆时针的话可以转化成为顺时针.
AC 代码:
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int n,a,b;
int ans;
cin>>n>>a>>b;
if(b>0)
{
ans=(a+b%n);
if(ans>n)
{
ans%=n;
}
cout<<ans<<endl;
}
else
{
b%=n;
b=-b;
ans=(a+(n-b)%n);
{
if(ans>n)
{
ans%=n;
}
}
cout<<ans<<endl;
}
return 0;
}