#include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T> using VVVV = VV<VV<T>>;
#define rep(i,n) for(ll i=0ll;i<n;i++)
#define REP(i,a,n) for(ll i=a;i<n;i++)
const long long INF = (1LL << 60);
const long long mod99 = 998244353;
const long long mod107 = 1000000007;
const long long mod = mod99;
#define eb emplace_back
#define pb eb
#define be(v) (v).begin(),(v).end()
#define all(i,v) for(auto& i : v)
#define all2(i,j,v) for(auto& [i,j] : v)
template<class T, class U> void chmin(T& t, const U& u) { if (t > u) t = u; }
template<class T, class U> void chmax(T& t, const U& u) { if (t < u) t = u; }

// cin.tie(nullptr);
// ios::sync_with_stdio(false);
// cout << fixed << setprecision(20);

void solve(){
  ll n,q;
  string s;
  cin >> n >> q >> s;
  V<ll> x(n+1, 0), y(n+1, 0);
  rep(i, n){
    x[i+1] = x[i];
    y[i+1] = y[i];
    if(s[i] == 'D') x[i+1]++;
    else y[i+1]++;
  }
  
  rep(i, q){
    ll h,w,p;
    cin >> h >> w >> p;
    h += x[p];
    w += y[p];
    p = 0;
    if(h >= x[n] && w >= y[n]){
      if(x[n] == 0) w %= y[n];
      else if(y[n] == 0) h %= x[n];
      else{
        ll m = min(h/x[n], w/y[n]);
        h -= m*x[n];
        w -= m*y[n];
      }
    }
    ll ans = min(lower_bound(be(x), h) - x.begin(), lower_bound(be(y), w) - y.begin());
    if(ans == n) ans = 0;
    cout << ans << endl;
  }
  
  
  
}





int main(){
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int t=1;
  // cin >> t;
  rep(i,t) solve();
}