import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt;
      const Q = readInt;
      const S = readToken;
      
      auto fs = new int[N + 1];
      foreach (i; 0 .. N) fs[i + 1] = fs[i] + ((S[i] == 'R') ? 1 : 0);
      long get(long n) {
        const q = n / N;
        const r = n % N;
        return q * fs[N] + fs[r];
      }
      
      foreach (q; 0 .. Q) {
        const H = readLong;
        const W = readLong;
        const P = readInt;
        long lo = -1, hi = H + W;
        for (; lo + 1 < hi; ) {
          const mid = (lo + hi) / 2;
          const rig = get(P + mid) - get(P);
          const dow = mid - rig;
          ((dow >= H || rig >= W) ? hi : lo) = mid;
        }
        debug {
          writeln("hi = ", hi);
        }
        const ans = (P + hi) % N;
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}