Codeforces Round #346 (Div. 2) A

A. Round House

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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分别代表入口的个数，a为当前所在的位置，b为负值时，逆时针走|b|长度，反之顺时针走|b|长度。

代码：

#include<cstdio>  
#include<cstring>
#include <algorithm>
#include <cmath>
using namespace std;  
#define maxn 100007
#define inf 0x3f3f3f3f
typedef long long ll;
int main()  
{  
#ifdef CDZSC_June
	freopen("t.txt", "r", stdin);  
	//freopen("E:\\w.txt", "w", stdout); 
#endif  
	int n,a,b,sum;
	while(~scanf("%d%d%d",&n,&a,&b))
	{
		int p = abs(b)%n;
		if(b<0){
			if(a<p){
				sum = (a+n)-p;
			}
			else{
				sum = a-p;
			}
		}
		else{
			sum = (a+p)%n;
		}
		if(sum == 0){
			printf("%d\n",n);
		}
		else{
			printf("%d\n",sum);
		}
	}
	return 0;  
}