n,a,b=list(map(int,input().split()))
c=b%n
if c>=0:
f=a+c
if f>n:
print(f-n)
else:
print(f)
else:
d=n+b
f=a+d
if f>n:
print(f-n)
else:
print(f)#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,a ,b;
cin>>n>>a>>b;
int k;
if(b<0){
while(b<0){
b+=n;
}
}
k = (a+b) % n;
if(k==0) k = n;
cout<<k<<endl;
return 0;
}1091A - New Year and the Christmas Ornament | 1352B - Same Parity Summands |
1102A - Integer Sequence Dividing | 630B - Moore's Law |
1004A - Sonya and Hotels | 1680B - Robots |
1690A - Print a Pedestal (Codeforces logo) | 1295A - Display The Number |
1077A - Frog Jumping | 1714G - Path Prefixes |
1369C - RationalLee | 289B - Polo the Penguin and Matrix |
1716A - 2-3 Moves | 1670B - Dorms War |
1716B - Permutation Chain | 987A - Infinity Gauntlet |
1676G - White-Black Balanced Subtrees | 1716D - Chip Move |
1352F - Binary String Reconstruction | 1487B - Cat Cycle |
1679C - Rooks Defenders | 56A - Bar |
1694B - Paranoid String | 35A - Shell Game |
1684A - Digit Minimization | 43B - Letter |
1017A - The Rank | 1698B - Rising Sand |
235A - LCM Challenge | 1075B - Taxi drivers and Lyft |