from bisect import bisect_left as bl
n,Q = map(int,input().split())
rS = [0]
dS = [0]
pr = 0
pd = 0
for s in input():
    if s=="R":
        pr += 1
    elif s == "D":
        pd += 1
    rS.append(pr)
    dS.append(pd)
hmod = dS[-1]
wmod = rS[-1]

for _ in range(Q):
    h,w,p = map(int,input().split())
    h += dS[p]
    w += rS[p]
    hbase,wbase = h // hmod, w // wmod
    hm,wm = h%hmod, w%wmod
    hidx = bl(dS,hm)
    widx = bl(rS,wm)
    # print(hidx,widx)

    if hbase*n + hidx >= wbase*n + widx:
        print(widx)

    else:
        print(hidx)