#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 1;


void solve(){
    ll n;
    int q;
    cin >> n >> q;
    string s; cin >> s;
    vector<ll> xsum(n, 0), ysum(n, 0);
    for(int i=0; i<n; i++){
        if(i>0){
            xsum[i] = xsum[i-1];
            ysum[i] = ysum[i-1];
        }

        if(s[i]=='D') xsum[i]++;
        else ysum[i]++;
    }

    while(q--){
        ll h, w, p;
        cin >> h >> w >> p;

        // xが先にhに到達
        {
            ll lo = p-1, hi = 2e9, mid;
            while(hi-lo>1){
                mid = (lo + hi)/2;
                ll x = xsum[n-1]*(mid/n) + xsum[mid%n];
                if(p>0) x -= xsum[p-1];

                if(x>=h) hi = mid;
                else lo = mid;
            }

            ll y = ysum[n-1]*(hi/n) + ysum[hi%n];
            if(p > 0) y -= ysum[p-1];

            if(y < w){
                cout << (hi+1)%n << '\n';
                continue;
            } 
        }
        
        // yが先にwに到達
        {
            ll lo = p-1, hi = 2e9, mid;
            while(hi-lo>1){
                mid = (lo + hi)/2;
                ll y = ysum[n-1]*(mid/n) + ysum[mid%n];
                if(p>0) y -= ysum[p-1];

                if(y>=w) hi = mid;
                else lo = mid;
            }

            cout << (hi+1)%n << '\n';
        }
    }
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    //cin >> T;
    while(T--) solve();
}