#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)

int main() {
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	
	int N, Q;
	string S;
	cin >> N >> Q >> S;
	
	vector<ll> sumD(2*N, 0);
	rep(i, 0, N) if (S[i] == 'D') sumD[i] = sumD[i + N] = 1;
	rep(i, 1, N*2) sumD[i] += sumD[i - 1];
	
	rep(query, 0, Q) {
		ll H, W, P;
		cin >> H >> W >> P;
		
		ll loopD = sumD[P + N - 1] - (P == 0 ? 0 : sumD[P - 1]);
		
		ll ok = H + W + 10, ng = 0;
		while (ok - ng > 1) {
			ll mid = (ok + ng) / 2;
			
			ll loop = mid / N;
			ll rest = mid % N;
			ll cntD = loop*loopD;
			if (P + rest - 1 >= 0) cntD += sumD[P + rest - 1];
			if (P - 1 >= 0) cntD -= sumD[P - 1];
			
			ll cntR = mid - cntD;
			
			if (cntD >= H || cntR >= W) ok = mid;
			else ng = mid;
		}
		cout << (ok + P) % N << '\n';
	}
}