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 bentrances 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.

Example

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.

一开始的程序竟然错了！！！？好吧，其实是自己忽略了个=的条件，然后找答案的时候发现一个超级简便的代码。

另外代码中之所以要先a--，是因为这里是没有0入口，如果不a--，就可能最后减后得0，然实际应该减后为n。

#include<iostream>
using namespace std;

int main()
{
    long long n,a,b;
    cin>>n>>a>>b;
    a--;
    a=a+100*n;
    a=a+b;
    cout<<a%n+1<<endl;
}

又发现一个代码更简便的

感叹

#include <bits/stdc++.h>
using namespace std;
int main(){
int n, a, b; scanf("%d %d %d", &n, &a, &b);
printf("%d\n", (a + b + 100 * n) % n ? (a + b + 100 * n) % n : n);
return 0;
}