#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll = long long;
ll N,Q;
string S;
vector<ll> H,W,P;
vector<ll> Rsum,Dsum;
void init(){
    Rsum = vector<ll>(N*2+1);
    Dsum = vector<ll>(N*2+1);
    for(ll i = 0;i<N*2;i++){
        if(S[i%N]=='R'){
            Rsum[i+1] = Rsum[i]+1;
            Dsum[i+1] = Dsum[i];
        }else{
            Rsum[i+1] = Rsum[i];
            Dsum[i+1] = Dsum[i]+1;
        }
    }
}

pair<ll,ll> query(ll l,ll r){
    pair<ll,ll> res = {0,0};
    ll div = (r-l)/N;
    res = {Dsum[N]*div,Rsum[N]*div};
    r -= N*div;
    res.first += Dsum[r]-Dsum[l];
    res.second += Rsum[r]-Rsum[l];
    return res;
}

void solve2(ll H,ll W,ll P){
    ll ok = P,ng = (1e9)*3;
    while(ng-ok>1){
        ll mid = (ok+ng)/2;
        auto [x,y] = query(P, mid);
        if(x>=H||y>=W){
            ng = mid;
        }else{
            ok = mid;
        }
    }
    cout<<ng%N<<endl;
}

void solve(){
    init();
    for(ll i = 0;i<Q;i++){
        solve2(H[i],W[i],P[i]);
    }
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>N>>Q;
    cin>>S;
    H = vector<ll>(Q);
    W = vector<ll>(Q);
    P = vector<ll>(Q);
    for(ll i = 0;i<Q;i++)
        cin>>H[i]>>W[i]>>P[i];
    solve();
}