#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 1000000000000000001

int main(){
	
	ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	
	int N,Q;
	cin>>N>>Q;
	
	string S;
	cin>>S;
	
	vector<long long> s0(N+1),s1(N+1);
	for(int i=1;i<=N;i++){
		if(S[i-1]=='D')s0[i]++;
		else s1[i]++;
		s0[i] += s0[i-1];
		s1[i] += s1[i-1];
	}
	
	rep(_,Q){
		int H,W;
		cin>>H>>W;
		int P;
		cin>>P;
		
		long long ok = 0,ng = H+W;
		while(ng-ok>1LL){
			long long mid = (ok+ng)/2;
			long long x = 0,y = 0;
			long long rem = mid;
			if(rem >= N-P){
				x += s0.back() - s0[P];
				y += s1.back() - s1[P];
				rem -= N-P;
			}
			else{
				x += s0[P+rem] - s0[P];
				y += s1[P+rem] - s1[P];
				rem = 0;
			}
			x += s0.back() * (rem/N);
			y += s1.back() * (rem/N);
			rem %= N;
			x += s0[rem];
			y += s1[rem];
			//cout<<mid<<' '<<x<<' '<<y<<endl;
			if(x<H && y<W)ok = mid;
			else ng = mid;
		}
	//	cout<<ok<<endl;
		cout<<(ok+P+1)%N<<endl;
		
		
	}
	
	
	return 0;
}