import io
import sys
from collections import defaultdict, deque, Counter
from itertools import permutations, combinations, accumulate
from heapq import heappush, heappop
from bisect import bisect_right, bisect_left
from math import gcd
import math

_INPUT = """\
6
4 3
RDDR
3 2 1
1 7 0
4 1 3
"""

def input():
  return sys.stdin.readline()[:-1]

def solve(test):
  N,Q=map(int,input().split())
  S=input()
  r,d=S.count('R'),S.count('D')
  r2=[0]
  for i in range(N):
    r2.append(r2[-1]+(S[i]=='R'))
  for i in range(N):
    r2.append(r2[-1]+(S[i]=='R'))
  d2=[0]
  for i in range(N):
    d2.append(d2[-1]+(S[i]=='D'))
  for i in range(N):
    d2.append(d2[-1]+(S[i]=='D'))
  for _ in range(Q):
    h,w,p=map(int,input().split())
    m=min((h-1)//d,(w-1)//r)
    h-=m*d
    w-=m*r
    print(min(bisect_left(d2,h+d2[p]),bisect_left(r2,w+r2[p]))%N)

def random_input():
  from random import randint,shuffle
  N=randint(1,10)
  M=randint(1,N)
  A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)]
  shuffle(A)
  return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3

def simple_solve():
  return []

def main(test):
  if test==0:
    solve(0)
  elif test==1:
    sys.stdin = io.StringIO(_INPUT)
    case_no=int(input())
    for _ in range(case_no):
      solve(0)
  else:
    for i in range(1000):
      sys.stdin = io.StringIO(random_input())
      x=solve(1)
      y=simple_solve()
      if x!=y:
        print(i,x,y)
        print(*[line for line in sys.stdin],sep='')
        break

#0:提出用、1:与えられたテスト用、2:ストレステスト用
main(0)