fn main() {
    let (n, q) = {
        let mut line = String::new();
        std::io::stdin().read_line(&mut line).unwrap();
        let mut iter = line.split_whitespace();
        (
            iter.next().unwrap().parse::<usize>().unwrap(),
            iter.next().unwrap().parse::<usize>().unwrap(),
        )
    };
    let s: Vec<char> = {
        let mut line = String::new();
        std::io::stdin().read_line(&mut line).unwrap();
        line.trim().chars().collect()
    };
    let hwp: Vec<_> = (0..q)
        .map(|_| {
            let mut line = String::new();
            std::io::stdin().read_line(&mut line).unwrap();
            let mut iter = line.split_whitespace();
            (
                iter.next().unwrap().parse::<usize>().unwrap(),
                iter.next().unwrap().parse::<usize>().unwrap(),
                iter.next().unwrap().parse::<usize>().unwrap(),
            )
        })
        .collect();

    // 文字列Sの通りに進んだときの累積距離
    let mut prefix_sum = vec![(0, 0); n + 1];
    for (i, &c) in s.iter().enumerate() {
        prefix_sum[i + 1] = prefix_sum[i];
        if c == 'D' {
            prefix_sum[i + 1].0 += 1;
        } else {
            prefix_sum[i + 1].1 += 1;
        }
    }

    let calc_progress = |left: usize, right: usize| {
        (
            prefix_sum[right].0 - prefix_sum[left].0,
            prefix_sum[right].1 - prefix_sum[left].1,
        )
    };

    let calc_sum_progress = |start: usize, mut move_num: usize| {
        let mut sum_progress = (0, 0);

        if start + move_num <= n {
            return calc_progress(start, start + move_num);
        }

        let progress1 = calc_progress(start, n);
        sum_progress.0 += progress1.0;
        sum_progress.1 += progress1.1;
        move_num -= n - start;

        let cycle_num = move_num / n;
        let progress2 = calc_progress(0, n);
        sum_progress.0 += progress2.0 * cycle_num;
        sum_progress.1 += progress2.1 * cycle_num;
        move_num -= cycle_num * n;

        let progress3 = calc_progress(0, move_num);
        sum_progress.0 += progress3.0;
        sum_progress.1 += progress3.1;

        sum_progress
    };

    let solve = |h: usize, w: usize, p: usize| {
        let mut ok = n * h.max(w);
        let mut ng = 0_usize;
        while ok.abs_diff(ng) > 1 {
            let mid = (ok + ng) / 2;

            let sum_progress = calc_sum_progress(p, mid);

            if sum_progress.0 >= h || sum_progress.1 >= w {
                ok = mid;
            } else {
                ng = mid;
            }
        }

        (p + ok) % n
    };

    for &(h, w, p) in &hwp {
        println!("{}", solve(h, w, p));
    }
}