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

瓦西娅住在一栋圆形建筑中，该建筑的入口按整数顺序编号，从 $1$ 到 $n$。入口 $n$ 与入口 $1$ 相邻。

今天瓦西娅感到无聊，决定到院子里散步。瓦西娅住在入口 $a$，他决定在散步过程中沿编号递增的方向绕楼行走 $b$ 个入口（即：在该方向上，入口 $n$ 后面紧接着的是入口 $1$）。若 $b$ 为负数，则表示沿编号递减的方向行走 $|b|$ 个入口（即：在该方向上，入口 $1$ 后面紧接着的是入口 $n$）。若 $b = 0$，则瓦西娅选择待在自己所在的入口旁不动。

示意图：$n = 6$，$a = 2$，$b = -5$。

请帮助瓦西娅确定他散步结束时所处的入口编号。

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.

输入仅包含一行，其中有三个以空格分隔的整数 $n$、$a$ 和 $b$（$1 ≤ n ≤ 100$，$1 ≤ a ≤ n$，$-100 ≤ b ≤ 100$），分别表示瓦夏住所的单元门数量、他所住的单元门编号以及他散步的长度。

Print a single integer k (1 ≤ k ≤ n) — the number of the entrance where Vasya will be at the end of his walk.

输出一个整数 $k$（$1 ≤ k ≤ n$）——即瓦夏最终所在入口的编号。

The first example is illustrated by the picture in the statements.

第一个示例由题目描述中的图片说明。