#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

//#define ENVIRONMENT_LINKED_ACL

#ifdef ENVIRONMENT_LINKED_ACL
#include <atcoder/convolution>
#include <atcoder/lazysegtree>
#include <atcoder/segtree.hpp>
#endif

//#define ENVIRONMENT_LINKED_BOOST

#ifdef ENVIRONMENT_LINKED_BOOST
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#endif

using namespace std;
using uint = unsigned int;
using ll   = long long;
using ull  = unsigned long long;
#define REP(i, a, b)    for (ll i = a; i < b; ++i)
#define REPREV(i, a, b) for (ll i = a; i > b; --i)

const int _ = []() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed << std::setprecision(10);
    return 0;
}();

template <typename value_t>
void resize(value_t& v, const value_t& val) { v = val; }
template <typename vec_t, typename value_t, typename... arg_t>
void resize(std::vector<vec_t>& v, const value_t& val, int size, arg_t... arg) {
    v.resize(size);
    for (auto& c : v) resize(c, val, arg...);
}

template <typename A, typename B>
void chmin(A& a, const B& b) {
    a = min(a, static_cast<A>(b));
};
template <typename A, typename B>
void chmax(A& a, const B& b) {
    a = max(a, static_cast<A>(b));
};

int main() {
    ll N;
    cin >> N;
    string s;
    cin >> s;
    ll Q;
    cin >> Q;
    bool flip = false;
    REP(q, 0, Q) {
        ll t, a, b;
        cin >> t >> a >> b;
        if (t == 1) {
            --a;
            --b;
            if (flip) {
                if (a >= N)
                    a -= N;
                else
                    a += N;
                if (b >= N)
                    b -= N;
                else
                    b += N;
            }
            swap(s[a], s[b]);
        }
        else {
            flip = !flip;
        }
    }
    if (flip)
        cout << s.substr(N) + s.substr(0, N) << endl;
    else
        cout << s << endl;

    return 0;
}

#include <bits/stdc++.h>
using namespace std;

#define int int64_t

int ok;
int n, q;
string s;

int f(int i) {
	if(ok)
		return i;
	if(i < n)
		return n + i;
	else
		return i - n;
}



int32_t main()
{
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	
	cin >> n >> s >> q;
	ok = 1;

	while(q--) {
		int t, a, b;
		cin >> t >> a >> b;
		a--, b--;

		if(t == 1)
			swap(s[f(a)], s[f(b)]);
		else
			ok ^= 1;
	}

	if(ok)
		cout << s;
	else {
		for(int i = 0; i < n; i++)
			swap(s[i], s[i + n]);
		cout << s;
	}
	
	
	
	return 0;
}