#include <bits/stdc++.h>
using namespace std;
const long long inf = (1ll << 62) - 1;
const long long mod = 1e9 + 7;
const long long N = 2e6 + 10;
const long double pi = 3.14159265358979323846;
long long bPow(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) {
      res = (res * a) % mod;
    }
    b >>= 1;
    a = (a * a) % mod;
  }
  return res % mod;
}
long long gcd(long long a, long long b) {
  if (a < b) swap(a, b);
  if (b == 0) return a;
  return gcd(b, a % b);
}
vector<long long> fact(N, 0ll);
void factorial() {
  fact[0] = 1, fact[1] = 1;
  for (long long i = 2; i < N; i++) {
    fact[i] = (fact[i - 1] * i) % mod;
  }
}
long long ncr(long long n, long long r) {
  if (r > n) return 0;
  long long ans = fact[n] % mod;
  ans *= bPow(fact[r], mod - 2) % mod;
  ans %= mod;
  ans *= bPow(fact[n - r], mod - 2) % mod;
  ans %= mod;
  return ans;
}
vector<long long> primes(N, -1);
void sieve() {
  iota(primes.begin(), primes.end(), 0);
  for (long long i = 2; i * i <= N; ++i) {
    if (primes[i] == i) {
      for (long long j = 2 * i; j < N; j += i) {
        primes[j] = i;
      }
    }
  }
}
void solve() {
  long long n, q;
  cin >> n >> q;
  long long boy1 = 0, boy2 = 1;
  while (q--) {
    long long t;
    cin >> t;
    boy1 %= n, boy2 %= n;
    if (t == 2) {
      if (boy1 & 1) {
        boy1--;
      } else {
        boy1++;
      }
      if (boy2 & 1) {
        boy2--;
      } else {
        boy2++;
      }
      continue;
    }
    long long move;
    cin >> move;
    if (move > 0) {
      move %= n;
      boy1 += move, boy2 += move;
    } else {
      move = -move;
      move %= n;
      boy1 += n - move, boy2 += n - move;
    }
  }
  boy1 %= n, boy2 %= n;
  vector<long long> ans(n, -1);
  long long cur = boy1;
  for (long long i = 1; i <= n; i += 2) {
    ans[cur % n] = i;
    cur += 2;
  }
  cur = boy2;
  for (long long i = 2; i <= n; i += 2) {
    ans[cur % n] = i;
    cur += 2;
  }
  for (long long i : ans) cout << i << " ";
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long tc = 1, test = 1;
  while (tc--) {
    solve();
  }
}
