#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, q; string s; cin >> n >> q >> s;
  vector<int> y(n + 1, 0), x(n + 1, 0);
  REP(i, n) {
    y[i + 1] = y[i] + (s[i] == 'D' ? 1 : 0);
    x[i + 1] = x[i] + (s[i] == 'R' ? 1 : 0);
  }
  while (q--) {
    int h, w, p; cin >> h >> w >> p;
    if (y[n] - y[p] < h && x[n] - x[p] < w) {
      h -= y[n] - y[p];
      w -= x[n] - x[p];
      p = 0;
      const int turn = min(y[n] == 0 ? INF : (h - 1) / y[n], x[n] == 0 ? INF : (w - 1) / x[n]);
      h -= y[n] * turn;
      w -= x[n] * turn;
    }
    int lb = -1, ub = n - p;
    while (ub - lb > 1) {
      const int mid = midpoint(lb, ub);
      (y[p + mid] - y[p] < h && x[p + mid] - x[p] < w ? lb : ub) = mid;
    }
    cout << (p + ub) % n << '\n';
  }
  return 0;
}