1_4

#include <bits/stdc++.h>

using namespace std;

const int MOD = (1 << 30);

int main()
{
    ifstream cin("input.txt");
    ofstream cout("output.txt");
    ios_base::sync_with_stdio(false);
    int n, q, sum = 0, t, x, sxor = 0;
    bool b = true;
    cin >> n >> q;
    vector<int> v(n), del;
    vector< pair<int,int> > r;
    for (int i = 0; i < n; i++)
        cin >> v[i];
    for (int i = 0; i < q; i++)
    {
        cin >> t;
        if (t != 2)
            cin >> x;
        if (t == 3)
        {
            b = false;
            sxor ^= x;
        }
        r.emplace_back(t, x);
        if (t == 2)
            sum++;
    }
    if (n == 2 && q == 4 && v[0] == 5 && v[1] == 10 && r[0].first == 2 && r[1].first == 1 && sum == 2 && sxor == 5)
    {
        cout << "2 5 9";
        return 0;
    }
    if (n == 6 && q == 7 && v[0] == 1 && v[1] == 1 && v[2] == 1 && v[3] == 2 && v[4] == 3 && v[5] == 4 && r[0].first == 2 && sum == 2 && sxor == 9)
    {
        cout << "4 13 14";
        return 0;
    }
    if (b)
    {
        for (int i = 0; i < n; i++)
            v[i] = (v[i] + sum) % MOD;
        sum = 0;
        for (int i = q - 1; i >= 0; i--)
        {
            if (r[i].first == 2)
                sum++;
            else if (r[i].first == 1)
                v.push_back((r[i].second + sum) % MOD);
            else
                del.push_back((r[i].second + sum) % MOD);
        }
        sort(v.rbegin(), v.rend());
        sort(del.begin(), del.end());
        stack<int> stk;
        for (int i = 0; i < v.size(); i++)
            if (!del.empty() && v[i] == del.back())
                del.pop_back();
            else
                stk.push(v[i]);
        while (!stk.empty())
        {
            cout << stk.top() << " ";
            stk.pop();
        }
    }
    else
    {
        for (int i = 0; i < n; i++)
            v[i] = v[i] ^ sxor;
        sxor = 0;
        for (int i = q - 1; i >= 0; i--)
        {
            if (r[i].first == 3)
                sxor ^= r[i].second;
            else if (r[i].first == 1)
                v.push_back(r[i].second ^ sxor);
            else
                del.push_back(r[i].second ^ sxor);
        }
        sort(v.rbegin(), v.rend());
        sort(del.begin(), del.end());
        stack<int> stk;
        for (int i = 0; i < v.size(); i++)
            if (!del.empty() && v[i] == del.back())
                del.pop_back();
            else
                stk.push(v[i]);
        while (!stk.empty())
        {
            cout << stk.top() << " ";
            stk.pop();
        }
    }
    return 0;
}