#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<queue>
#include<cstdlib>
using namespace std;
string s,ans,need,c1,c2;
int k,m,n,a,b,c;
int main()
{
	freopen("copypaste.in","r",stdin);
	freopen("copypaste.out","w",stdout);
	scanf("%d%d",&k,&m);
	cin>>s;
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%d%d%d",&a,&b,&c);
		need=s.substr(a,b-a);
		c1=s.substr(0,c);
		c2=s.substr(c,s.length());
	     s=c1+need+c2;
		if(s.size()>m) s.erase(m,s.length());
		
	}
	ans=s.substr(0,k);
	cout<<ans;
	return 0;
}