#include "bits/stdc++.h" #include #include #include "atcoder/all" #include //#include //using namespace boost::multiprecision; using namespace std; using namespace atcoder; #ifdef _MSVC_LANG inline int getchar_unlocked() { return getchar(); } #endif using ll = long long; using ull = unsigned long long; using mint = modint998244353; using mint2 = modint1000000007; const double eps = 1e-9; #define REP(i, n) for (ll i = 0; i < ll(n); ++i) #define REPI(i, init, n) for (ll i = init; i < ll(n); ++i) #define REPD(i, init) for (ll i = init; i >=0; --i) #define REPDI(i, init, n) for (ll i = init; i >=n; --i) #define REPE(i, c) for (const auto& i : c) #define TCASE() ll _ttt; cin >> _ttt; while(_ttt--) using vl = vector; using vvl = vector; using vvvl = vector; #define VLI(a, n) vector a; a.assign(n, 0); for(auto& x : a) cin >> x; #define DLI(a, n) deque a; a.assign(n, 0); for(auto& x : a) cin >> x; #define VSI(a, n) vector a; a.assign(n, ""); for(auto& x : a) cin >> x; #define VVLI(a, n, m, init) vector> a(n); for(auto& x : a) x.assign(m, init); using vd = vector; using pl = pair; using vpl = vector; struct uv { ll u; ll v; ll c; }; #define VUVI(a, n) vector a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;} #define VUVCI(a, n) vector a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;} vvl to_edge(const ll n, const vector& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; } vvl to_edge_d(const ll n, const vector& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; } template using pql = priority_queue; template using pqg = priority_queue, greater>; using vm = vector; using vvm = vector; ostream& operator<<(ostream& os, const mint& v) { os << v.val(); return os; } void yn(bool f) { std::cout << (f ? "Yes" : "No") << endl; }; template void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } }; template<> void ov(const vm& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << it->val(); } }; const ll llhuge = 1LL << 62; //十分でかいが多少足しても溢れない数値 auto gmax(const auto& a, const auto& b) { return a > b ? a : b; }; auto gmin(const auto& a, const auto& b) { return a < b ? a : b; }; bool chmin(auto& a, const auto& b) { const auto olda = a; a = gmin(a, b); return olda != a; } bool chmax(auto& a, const auto& b) { const auto olda = a; a = gmax(a, b); return olda != a; } template void mysort(T& v) { std::sort(begin(v), end(v)); }; template void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); }; template void myrev(T& v) { std::reverse(begin(v), end(v)); }; template [[nodiscard]] V myat(const T& mp, const K& key) { return mp.find(key) == mp.end() ? V() : mp.at(key); } long long ceil(const long long a, const long long b) { return (a + b - 1) / b; } //二分探索でf(t)を満たす整数tを返す //ng < ok ならtは最小値 ng > ok ならtは最大値 template ll bs(ll ng, ll ok, F f) { while (abs(ok - ng) > 1) { ll mid = (ok + ng) / 2; if (f(mid)) ok = mid; else ng = mid; } return ok; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); ll n, q; cin >> n >> q; string s; cin >> s; ll dc = 0; ll rc = 0; REP(i, n) { if (s[i] == 'D') dc++; else rc++; } vector sum(n * 2 + 1, { 0, 0 }); REP(i, n * 2) { sum[i + 1].first = sum[i].first + (s[i % n] == 'D' ? 1 : 0); sum[i + 1].second = sum[i].second + (s[i % n] == 'R' ? 1 : 0); } REP(i, q) { ll ans = 0; ll h, w, p; cin >> h >> w >> p; if (h > dc && w > rc && dc > 0 && rc > 0) { ll lpc = min(h / dc, w / rc); ans += (lpc * n) % n; h -= lpc * dc; w -= lpc * rc; } else if (h > dc && dc > 0 && rc == 0) { ll lpc = h / dc; ans += (lpc * n) % n; h -= lpc * dc; } else if (w > rc && rc > 0 && dc == 0) { ll lpc = w / rc; ans += (lpc * n) % n; w -= lpc * rc; } ans += bs(0, n, [&](ll x) { if (x < 0) return false; ll th = sum[x+p].first - sum[p].first; ll tw = sum[x+p].second - sum[p].second; return th >= h || tw >= w; }); cout << (ans + p) % n << endl; } }