#include<set>
#include<map>
#include<stack>
#include<queue>
#include<cmath>
#include<cctype>
#include<cstdio>
#include<string>
#include<vector>
#include<cstring>
#include<cstdlib>
#include<utility>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int INF = 0x3f3f3f3f;
string s;
int k, m, n;
int main()
{
  freopen("copypaste.in", "r", stdin);
  freopen("copypaste.out", "w", stdout);
  cin >> k >> m >> s >> n;
  int a, b, c;
  for(int i = 0; i < n; i++){
    scanf("%d%d%d", &a, &b, &c);
    s.insert(c, s.substr(a, b - a));
    s.resize(m);
  }
  cout << s.substr(0, k) << endl;
  return 0;
}