#include <bits/stdc++.h> using namespace std; using ll = long long; ll p,q; ll h,w,k; ll bs(ll l, ll r, vector<ll>&X,ll x){ if (l>r){ return l; } ll m = (l+r)/2; ll t = X[p] * ((m+k)/p) + X[(m+k)%p]; t -= X[p]*(k/p) + X[k%p]; if (t<x){ return bs(m+1,r,X,x); } else { return bs(l,m-1,X,x); } } int main(){ cin >> p >> q; string s; cin >> s; vector<ll> H (p+1,0); vector<ll> W (p+1,0); for (int i=0;i<p;i++){ if (s[i]=='R'){ H[i+1] = H[i]; W[i+1] = W[i]+1; } else if (s[i]=='D'){ H[i+1] = H[i]+1; W[i+1] = W[i]; } } for (int i=0;i<q;i++){ cin >> h >> w >> k; vector<ll> hw = {h,w}; ll ans = 100000000000; int j = 0; for (auto X:{H,W}){ ll x = hw[j]; if (X[p]==0){ continue; } ll res = bs(0,p,X,x); ans = min(ans,res); j++; } cout << (ans+k)%p << endl; } }