#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
template <class T, class F>
T binarySearch(T ok, T ng, const F &f) {
	while (abs(ok - ng) > 1) {
		T mid = (ok + ng) / 2;
		(f(mid) ? ok : ng) = mid;
	}
	return ok;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, q; cin >> n >> q;
	string s; cin >> s;
	vector<int>sr(n + 1), sd(n + 1);
	rep(i, n) {
		sr[i + 1] = sr[i];
		sd[i + 1] = sd[i];
		if ('D' == s[i])sd[i + 1]++;
		else sr[i + 1]++;
	}
	while (q--) {
		int h, w, p;
		cin >> h >> w >> p;
		auto g = [&](long long x)->pair<long long, long long> {
			long long r = 0;
			r += (x / n) * sr.back();
			r += sr[x % n] - sr[0];
			long long d = 0;
			d += (x / n) * sd.back();
			d += sd[x % n] - sd[0];
			return { d,r };
		};
		auto f = [&](long long x)->bool {
			auto p0 = g(p);
			auto p1 = g(x + p);
			p1.first -= p0.first;
			p1.second -= p0.second;
			return p1.first >= h || p1.second >= w;
		};
		auto ans = binarySearch<long long>(LINF, 0, f);
		cout << (ans + p) % n << endl;
	}
	return 0;
}