///Bismillahir Rahmanir Rahim
#include "bits/stdc++.h"

#define                           ll                          long long
#define                           int                         ll
#define                           fi                          first
#define                           si                          second
#define                           mp                          make_pair
#define                           pb                          push_back
#define                           pi                          pair<int,int>
#define                           nd(a,b,c)                   mp(mp(a,b),c)
#define                           clr(x)                      memset(x,0,sizeof(x));
#define                           f(i,l,r)                    for(int i=l;i<=r;i++)
#define                           rf(i,r,l)                   for(int i=r;i>=l;i--)
#define                           done(i)                     cout<<"done = "<<i<<endl;
#define                           show(x,y)                   cout<<x<<" : ";for(auto z:y)cout<<z<<" ";cout<<endl;
#define                           fast                        ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

using namespace std;

const ll inf=2e18;
const int mod=1e9+7;
const int M=200005;
char x[M],y[M];
void solve()
{
   int n,flag=0;
   cin>>n;
   string s;
   cin>>s;
   for(int i=1;i<=n;i++)
   {
       x[i]=s[i-1];
       y[i]=s[i-1+n];
   }
   x[n+1]='\0';
   y[n+1]='\0';
   int q;
   cin>>q;
   while(q--)
   {
       int typ,u,v,p,q;
       cin>>typ>>u>>v;
       if(typ==2)
       {
           flag=1-flag;
       }
       else
       {

           if(flag==0)
           {
                if(v<=n)
                {
                    swap(x[u],x[v]);continue;
                }
                if(u>n)
                {
                    swap(y[u-n],y[v-n]);continue;
                }
                p=u;q=v-n;
                swap(x[p],y[q]);
           }
           else
           {
               if(v<=n)
                {
                    swap(y[u],y[v]);continue;
                }
                if(u>n)
                {
                    swap(x[u-n],x[v-n]);continue;
                }
               p=v-n;q=u;
               swap(x[p],y[q]);
           }
       }
   }
   if(flag==0)
   {
       f(i,1,n)cout<<x[i];
       f(i,1,n)cout<<y[i];
       cout<<"\n";
   }
   else
   {
       f(i,1,n)cout<<y[i];
       f(i,1,n)cout<<x[i];
       cout<<"\n";
   }
}
 main()

{
    fast
    int t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
    return 0;

}




































//#define _GLIBCXX_DEBUG
//#include "atcoder/all"
//using namespace atcoder;
#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
#define Dump(x)                             \
    if (dbg) {                              \
        cerr << #x << " = " << (x) << endl; \
    }
#define overload4(_1, _2, _3, _4, name, ...) name
#define FOR1(n) for (ll i = 0; i < (n); ++i)
#define FOR2(i, n) for (ll i = 0; i < (n); ++i)
#define FOR3(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)
#define bit(n, k) (((n) >> (k)) & 1) /*nのk bit目*/
namespace mydef {
const int INF = 1ll << 60;
const int MOD = 1e9 + 7;
template <class T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;
        return 1;
    } else
        return 0;
}
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    } else
        return 0;
}
void Yes(bool flag = true) {
    if (flag)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
}
void No(bool flag = true) {
    Yes(!flag);
}
void YES(bool flag = true) {
    if (flag)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
}
void NO(bool flag = true) {
    YES(!flag);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T& val) {
    std::fill((T*)array, (T*)(array + N), val);
}
bool dbg = true;
}  // namespace mydef
using namespace mydef;
#define pb push_back
//#define mp make_pair
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define SZ(x) ((int)(x).size())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vp vector<pair<int, int>>
#define vvp vector<vector<pair<int, int>>>
#define pi pair<int, int>
//#define P pair<int, int>
//#define V vector<int>
//#define S set<int>
#define asn ans

int N, M;
vector<pi> G[101010];

int ans[101010];

int seen[101010];

void dfs(int now, int bef) {
    if (seen[now])
        return;
    seen[now] = 1;
    for (auto& p : G[now]) {
        int nxt = p.first;
        if (seen[nxt])
            continue;
        if (bef == nxt)
            continue;
        int c = p.second;
        int nxt_c;
        if (ans[now] == c) {
            nxt_c = (c + 1) % N;
        } else
            nxt_c = c;
        ans[nxt] = nxt_c;
        dfs(nxt, now);
    }
}

void solve() {
    dfs(0, -1);
    for (int i = 0; i < N; i++) {
        cout << ans[i] + 1 << endl;
    }
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    cin >> N >> M;
    for (int i = 0; i < M; i++) {
        int u, v, c;
        cin >> u >> v >> c;
        u--;
        v--;
        c--;
        G[u].push_back({v, c});
        G[v].push_back({u, c});
    }

    solve();
    return 0;
}
