CodeForces 659A Round House(技巧)

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

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.

题意：有n个点从小到大按顺时针围成一个环，给出起点a和走的步数b，如果b小于零，则按逆时针走，如果b大于零，按顺时针走。问终点的标号.

代码如下：

#include<cstdio>
#include<cstring>
using namespace std;
int n,a,b,m,ans;
int main()
{
	while(scanf("%d%d%d",&n,&a,&b)!=EOF)
	{
		if(b>=0)
		{
		  if(b<=n-a)
		  {
		  	ans=a+b;
		  }	
		  else
		  {
		  	ans=(b+a-1)%n+1;//使起点变为标号1，且步数b+a-1,取余n，得到最后一圈内走 的步数，再加一即为终点的标号. 
		  }
		}
		else if(b<0)
		{
			b=-b;
			if(b<a)
			{
				ans=a-b;
			}
			else if(b>=a)
			{
				m=(b-a)%n;
				ans=n-m;
			}
		}
		printf("%d\n",ans);
	}
}