import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

n,q=LI()
a=[0]*(n+1)
b=[0]*(n+1)
for i,c in enumerate(SI()):
    if c=="D":a[i+1]=1
    else:b[i+1]=1

for i in range(n):
    a[i+1]+=a[i]
    b[i+1]+=b[i]

def binary_search(l, r, minimize):
    if minimize: l -= 1
    else: r += 1
    while l+1 < r:
        m = (l+r)//2
        if ok(m) ^ minimize: l = m
        else: r = m
    if minimize: return r
    return l

def ok(m):
    t,r=divmod(m,n)
    i=a[-1]*t+a[r]-a[p]
    j=b[-1]*t+b[r]-b[p]
    # print(m,i,j)
    return i>=h or j>=w

for _ in range(q):
    h,w,p=LI()
    c=binary_search(p,3*10**9,True)
    print(c%n)