Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
B. Little Artem and Dance

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputLittle Artem is fond of dancing. Most of all dances Artem likes rueda — Cuban dance that is danced by pairs of boys and girls forming a circle and dancing together.

More detailed, there are *n* pairs of boys and girls standing in a circle. Initially, boy number 1 dances with a girl number 1, boy number 2 dances with a girl number 2 and so on. Girls are numbered in the clockwise order. During the dance different moves are announced and all pairs perform this moves. While performing moves boys move along the circle, while girls always stay at their initial position. For the purpose of this problem we consider two different types of moves:

- Value
*x*and some direction are announced, and all boys move*x*positions in the corresponding direction. - Boys dancing with even-indexed girls swap positions with boys who are dancing with odd-indexed girls. That is the one who was dancing with the girl 1 swaps with the one who was dancing with the girl number 2, while the one who was dancing with girl number 3 swaps with the one who was dancing with the girl number 4 and so one. It's guaranteed that
*n*is even.

Your task is to determine the final position of each boy.

Input

The first line of the input contains two integers *n* and *q* (2 ≤ *n* ≤ 1 000 000, 1 ≤ *q* ≤ 2 000 000) — the number of couples in the rueda and the number of commands to perform, respectively. It's guaranteed that *n* is even.

Next *q* lines contain the descriptions of the commands. Each command has type as the integer 1 or 2 first. Command of the first type is given as *x* ( - *n* ≤ *x* ≤ *n*), where 0 ≤ *x* ≤ *n* means all boys moves *x* girls in clockwise direction, while - *x* means all boys move *x* positions in counter-clockwise direction. There is no other input for commands of the second type.

Output

Output *n* integers, the *i*-th of them should be equal to the index of boy the *i*-th girl is dancing with after performing all *q* moves.

Examples

Input

6 3

1 2

2

1 2

Output

4 3 6 5 2 1

Input

2 3

1 1

2

1 -2

Output

1 2

Input

4 2

2

1 3

Output

1 4 3 2

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/04/2020 20:22:36 (h1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|