import sys
sys.setrecursionlimit(5*10**5)
input = sys.stdin.readline
from collections import defaultdict, deque, Counter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right
from math import gcd

n,q = map(int,input().split())
s = input().rstrip()
s = s+s
d = [0]*(2*n+1)
r = [0]*(2*n+1)
for i in range(2*n):
    if s[i] == "D":
        d[i+1] = 1
    else:
        r[i+1] = 1
    d[i+1] += d[i]
    r[i+1] += r[i]

dnum = d[-1]//2
rnum = r[-1]//2

for i in range(q):
    h,w,p = map(int,input().split())
    p += 1
    dloop = 10**15
    rloop = 10**15
    dt = n
    rt = n
    if dnum != 0:
        dloop = h//dnum
        dleft = d[p-1] + (h%dnum)
        dt = bisect_left(d, dleft)
    if rnum != 0:
        rloop = w//rnum
        rleft = r[p-1] + (w%rnum)
        rt = bisect_left(r, rleft)
    if dt >= n:
        dloop += dt//n
        dt %= n
    if rt >= n:
        rloop += rt//n
        rt %= n
    if [dloop, dt] <= [rloop, rt]:
        print(dt)
    else:
        print(rt)