qwq

#include <bits/stdc++.h>

using namespace std;

int a[1000086];

int main () {
	int n, m;
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++) a[i] = i;
	int tmp = 1;
	while (m--) {
		int opt;
		scanf("%d", &opt);
		if (opt == 1) tmp = 1;
		if (opt == 2) tmp = 0;
		if (opt == 3) {
			int x, y;
			scanf("%d%d", &x, &y);
			if (tmp == 1) swap(a[x], a[y]);
			else swap(a[n - x + 1], a[n - y + 1]);
		}
		if (opt == 4) 	
			if (tmp == 1) tmp = 0;
			else tmp = 1;
	}
	for (int i = 1; i <= n; i++) printf("%d ", a[i]);
	return 0;
}