#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
template<int mod>istream &operator>>(istream &is,static_modint<mod> &a){long long b;is>>b;a=b;return is;}
istream &operator>>(istream &is,modint &a){long long b;cin>>b;a=b;return is;}
#endif
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) static_cast<void>(0)
#define debugg(...) static_cast<void>(0)
template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}
#endif
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}
template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}
template<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}
template<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}
#define reps(i,a,n) for(int i=(a);i<(n);i++)
#define rep(i,n) reps(i,0,n)
#define all(x) x.begin(),x.end()
#define pcnt(x) __builtin_popcountll(x)
#define fin(x) return cout<<x<<'\n',static_cast<void>(0)
ll myceil(ll a,ll b){return (a+b-1)/b;}
template<typename T,size_t n,size_t id=0>
auto vec(const int (&d)[n],const T &init=T()){
  if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));
  else return init;
}
void SOLVE();
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout<<fixed<<setprecision(16);
  #ifdef LOCAL
  clock_t start=clock();
  #endif
  int testcase=1;
  //cin>>testcase;
  for(int i=0;i<testcase;i++){
    SOLVE();
  }
  #ifdef LOCAL
  cerr<<"time:";
  cerr<<(clock()-start)/1000;
  cerr<<"ms\n";
  #endif
}
void SOLVE(){
  int n,q;
  cin>>n>>q;
  string s;
  cin>>s;
  vector<int>d(n+1,0),r(n+1,0);
  rep(i,n)(s[i]=='D'?d:r)[i]++;
  for(int i=n-1;i>=0;i--)d[i]+=d[i+1],r[i]+=r[i+1];
  auto get=[&](ll left,ll right,bool isd)->ll {
    auto &now=isd?d:r;
    ll ret=now[0]*(right/n-left/n);
    ret-=now[0]-now[left%n];
    ret+=now[0]-now[right%n];
    return ret;
  };
  while(q--){
    ll h,w,p;
    cin>>h>>w>>p;
    ll dmx,rmx;
    if(d[0]==0)dmx=1e18;
    else{
      ll ok=1e15;
      ll ng=p-1;
      while(ok-ng>1){
        ll mid=(ok+ng)/2;
        (get(p,mid,true)>=h?ok:ng)=mid;
      }
      dmx=ok-p;
    }
    if(r[0]==0)rmx=1e18;
    else{
      ll ok=1e15;
      ll ng=p-1;
      while(ok-ng>1){
        ll mid=(ok+ng)/2;
        (get(p,mid,false)>=w?ok:ng)=mid;
      }
      rmx=ok-p;
    }
    debug(dmx,rmx);
    cout<<(p+min(dmx,rmx))%n<<endl;
  }
}