#include <bits/stdc++.h>
using namespace std;

int main() {
    long long n, q;
    string s;
    cin >> n >> q >> s;
    vector<long long> d(n + 1), r(n + 1);
    for (int i = 0; i < n; i++) {
        if (s[i] == 'D') {
            d[i + 1]++;
        } else {
            r[i + 1]++;
        }
    }
    for (int i = 1; i <= n; i++) {
        d[i] += d[i - 1];
        r[i] += r[i - 1];
    }
    auto getd = [&](long long x) {
        return d[n] * (x / n) + d[x % n];
    };
    auto getr = [&](int x) {
        return r[n] * (x / n) + r[x % n];
    };
    while (q--) {
        long long h, w, p;
        cin >> h >> w >> p;
        long long l = 2000000010, r = 0LL;
        while (l - r > 1) {
            long long mid = (l + r) / 2;
            long long cntd = getd(p + mid) - getd(p);
            long long cntr = getr(p + mid) - getr(p);
            if (cntd >= h || cntr >= w) {
                l = mid;
            } else {
                r = mid;
            }
        }
        cout << (p + l) % n << endl;
    }
}