B. Counting-out Rhyme（约瑟夫环）

Description

n children are standing in a circle and playing the counting-out game. Children are numbered clockwise from 1 to n. In the beginning, the first child is considered the leader. The game is played in k steps. In the i-th step the leader counts out a_i people in clockwise order, starting from the next person. The last one to be pointed at by the leader is eliminated, and the next player after him becomes the new leader.

For example, if there are children with numbers [8, 10, 13, 14, 16] currently in the circle, the leader is child 13 and a_i = 12, then counting-out rhyme ends on child 16, who is eliminated. Child 8 becomes the leader.

You have to write a program which prints the number of the child to be eliminated on every step.

Input

The first line contains two integer numbers n and k (2 ≤ n ≤ 100, 1 ≤ k ≤ n - 1).

The next line contains k integer numbers a₁, a₂, ..., a_k (1 ≤ a_i ≤ 10⁹).

Output

Print k numbers, the i-th one corresponds to the number of child to be eliminated at the i-th step.

Sample Input

Input

7 5
10 4 11 4 1

Output

4 2 5 6 1 

Input

3 2
2 5

Output

3 2 

Hint

Let's consider first example:

• In the first step child 4 is eliminated, child 5 becomes the leader.
• In the second step child 2 is eliminated, child 3 becomes the leader.
• In the third step child 5 is eliminated, child 6 becomes the leader.
• In the fourth step child 6 is eliminated, child 7 becomes the leader.
• In the final step child 1 is eliminated, child 3 becomes the leader.

题目意思：

n个人围成一圈坐着，每个人（编号定为1~n）有一个数字a（限定条件：a的范围为1~n，且每个数字只出现一次），

现在如果指定一个人为leader，下一个leader为从他的顺时针方向第一个人开始数 a .以此类推，现在给出一系列按顺序成为leader的人的编号，

问是否存在这样一种情况，能够在限定条件内确定每个人的数字，满足成为leader顺序的结果，如果有多种结果，输出一种，没有输出 -1。

解题思路：这其实就是一道约瑟夫环问题

 #include<stdio.h>
 #include<deque>
 #include<string.h>
 using namespace std;
 int main()
 {
     int n,k,i,j,b[],a,c;
         deque<int> q;
     scanf("%d%d",&n,&k);
     for(i=;i<=n;i++)
     {
         q.push_back(i);
     }
     for(i=;i<=k;i++)
     {
         scanf("%d",&b[i]);
     }
     for(i=;i<=k;i++)
     {
         b[i]=b[i]%n;
         for(j=;j<=b[i];j++)
         {
             a=q.front();
             q.pop_front();
             q.push_back(a);
         }
         c=q.front();
         printf("%d ",c);
         q.pop_front();
         n--;
     }
     return ;
 }