#include <bits/stdc++.h>
using namespace std;
int n, q;
void read() { scanf("%d%d", &n, &q); }
void solve() {
  int p0 = 0, p1 = 0, l = 0;
  while (q--) {
    int t;
    scanf("%d", &t);
    if (t == 1) {
      int x;
      scanf("%d", &x);
      p1 = (p1 + x) % n;
      p0 = (p0 + x) % n;
      l ^= ((x % 2) + 2) % 2;
    } else {
      if (!l) {
        p0 = (p0 + 1) % n;
        p1 = (p1 - 1) % n;
      } else {
        p0 = (p0 - 1) % n;
        p1 = (p1 + 1) % n;
      }
      l ^= 1;
    }
  }
  if (l == 1) swap(p0, p1);
  for (int i = 0; i < n; i++) {
    int x;
    x = (i - p0 + n) % n;
    printf("%d ", x + 1);
    swap(p0, p1);
  }
}
int main() {
  read();
  solve();
  return 0;
}
