#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const int INF = 2e9;
const long long MOD = 1e9 + 7;
const int MAXN = 1e5 + 2;
const int MN = 1e6 + 3;
int d1, d2;
int p1, p2;
bool usual = 1;
int ans[MN];
int main() {
  int n, q;
  scanf("%d %d", &n, &q);
  p1 = 0, p2 = 1;
  int tipo, x;
  int pareja;
  for (int(i) = (0); (i) < (q); ++(i)) {
    scanf("%d", &tipo);
    if (tipo == 1) {
      scanf("%d", &x);
      p1 += x, p2 += x;
    } else {
      if (p1 % 2 == 0)
        p1++;
      else
        p1--;
      if (p2 % 2 == 0)
        p2++;
      else
        p2--;
    }
    p1 %= n;
    if (p1 < 0) p1 += n;
    p2 %= n;
    if (p2 < 0) p2 += n;
  }
  int tt;
  for (int i = 0; i < n; i += 2) {
    tt = (p1 + i) % n;
    if (tt < 0) tt += n;
    ans[tt] = i;
  }
  for (int i = 1; i < n; i += 2) {
    tt = (p2 + i - 1) % n;
    if (tt < 0) tt += n;
    ans[tt] = i;
  }
  for (int(i) = (0); (i) < (n); ++(i)) printf("%d ", ans[i] + 1);
  return 0;
}
