#include <bits/stdc++.h>
using namespace std;
const long long INF = 1 << 28;
const long long LINF = 1ll << 61;
inline long long getnum() {
  register long long r = 0;
  register bool ng = 0;
  register char c;
  c = getchar();
  while (c != '-' && (c < '0' || c > '9')) c = getchar();
  if (c == '-') ng = 1, c = getchar();
  while (c != ' ' && c != '\n') r = r * 10 + c - '0', c = getchar();
  if (ng) r = -r;
  return r;
}
template <class T>
inline void putnum(T x) {
  if (x < 0) putchar('-'), x = -x;
  register short a[20] = {}, sz = 0;
  while (x > 0) a[sz++] = x % 10, x /= 10;
  if (sz == 0) putchar('0');
  for (int i = sz - 1; i >= 0; i--) putchar('0' + a[i]);
}
inline void putsp() { putchar(' '); }
inline void putendl() { putchar('\n'); }
inline char mygetchar() {
  register char c = getchar();
  while (c == ' ' || c == '\n') c = getchar();
  return c;
}
int n, m, ans[1000111];
vector<pair<int, int> > cmd;
int main() {
  n = getnum(), m = getnum();
  for (int i = 1; i <= m; i++) {
    int x, y = 0;
    x = getnum();
    if (x == 1) y = getnum();
    cmd.push_back(make_pair(x, y));
  }
  int x = 1;
  for (int i = 0; i < cmd.size(); i++) {
    if (cmd[i].first == 1)
      x = (x + cmd[i].second - 1 + n) % n + 1;
    else
      x = ((x + 1) ^ 1) - 1;
  }
  for (int i = 1; i <= n; i++)
    if (i & 1) ans[(i - 1 + x + n - 1) % n + 1] = i;
  x = 2;
  for (int i = 0; i < cmd.size(); i++) {
    if (cmd[i].first == 1)
      x = (x + cmd[i].second - 1 + n) % n + 1;
    else
      x = ((x + 1) ^ 1) - 1;
  }
  for (int i = 1; i <= n; i++)
    if (!(i & 1)) ans[(i - 2 + x + n - 1) % n + 1] = i;
  for (int i = 1; i <= n; i++) putnum(ans[i]), putsp();
  return 0;
}
