#include <bits/stdc++.h> using namespace std; typedef long long ll; template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; } template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; } #define all(x) (x).begin(),(x).end() #define fi first #define se second #define mp make_pair #define si(x) int(x.size()) const int mod=998244353,MAX=300005,INF=15<<26; int main(){ std::ifstream in("text.txt"); std::cin.rdbuf(in.rdbuf()); cin.tie(0); ios::sync_with_stdio(false); int N,Q;cin>>N>>Q; string S;cin>>S; vector<ll> A(N+1),B(N+1); for(int i=0;i<N;i++){ A[i+1]=A[i]; B[i+1]=B[i]; if(S[i]=='D') A[i+1]++; else B[i+1]++; } while(Q--){ ll H,W,P;cin>>H>>W>>P; H+=A[P]; W+=B[P]; ll L=0,R=15LL<<58; while(R-L>1){ ll M=(L+R)/2; ll to=M; ll h=(to/N)*A[N]+(A[to%N]); ll w=(to/N)*B[N]+(B[to%N]); if(h<H&&w<W) L=M; else R=M; } cout<<R%N<<"\n"; } }