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

#define rep(i, n) for (int i = 0; i < (int)n; i++)

int main() {
  int N, Q;
  cin >> N >> Q;
  string S;
  cin >> S;
  vector<int> h(N+1), w(N+1);
  rep(i, N) {
    if (S[i] == 'D') {
      h[i+1] = h[i] + 1;
      w[i+1] = w[i];
    }
    if (S[i] == 'R') {
      h[i+1] = h[i];
      w[i+1] = w[i] + 1;
    }
  }
  rep(j, Q) {
    int H, W, P;
    cin >> H >> W >> P;
    int h0 = (h[P % N] + H);
    int w0 = (w[P % N] + W);
    int nh = (h0 % h[N] == 0) ? (h0 / h[N] - 1) * N : (h0 / h[N]) * N;
    int nw = (w0 % w[N] == 0) ? (w0 / w[N] - 1) * N : (w0 / w[N]) * N;
    nh += lower_bound(h.begin(), h.end(), h0-(nh/N)*h[N]) - h.begin();
    nw += lower_bound(w.begin(), w.end(), w0-(nw/N)*w[N]) - w.begin();
    cout << min(nh, nw) % N << endl;
  }
  return 0;
}