#[allow(unused_imports)]
use std::cmp::{Ordering};

#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};

#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};

#[allow(unused_imports)]
use std::iter::FromIterator;

#[allow(unused_macros)]
macro_rules! min {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::min($x, min!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! max {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::max($x, max!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! get { 
    ([$t: ty]) => { 
        { 
            let mut line = String::new(); 
            stdin().read_line(&mut line).unwrap(); 
            line.split_whitespace().map(|t|t.parse::<$t>().unwrap()).collect::<Vec<_>>()
        }
    };
    ([$t: ty];$n: expr) => {
        (0..$n).map(|_|get!([$t])).collect::<Vec<_>>()
    };
    ($t: ty) => {
        {
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            line.trim().parse::<$t>().unwrap()
        }
    };
    ($($t: ty),*) => {
        { 
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            let mut iter = line.split_whitespace();
            ($(iter.next().unwrap().parse::<$t>().unwrap(),)*)
        }
    };
    ($t: ty; $n: expr) => {
        (0..$n).map(|_|get!($t)).collect::<Vec<_>>()
    };
    ($($t: ty),*; $n: expr) => {
        (0..$n).map(|_|get!($($t),*)).collect::<Vec<_>>()
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        #[cfg(debug_assertions)]
        writeln!(&mut std::io::stderr(), concat!("[DEBUG] ", $(stringify!($a), "={:?} "),*), $($a),*).unwrap();
    }
}

const BIG_STACK_SIZE: bool = true;

#[allow(dead_code)]
fn main() {
    use std::thread;
    if BIG_STACK_SIZE {
        thread::Builder::new()
            .stack_size(32 * 1024 * 1024)
            .name("solve".into())
            .spawn(solve)
            .unwrap()
            .join()
            .unwrap();
    } else {
        solve();
    }
}

fn solve() {
    let s = get!(String);
    let (x,y) = get!(isize, isize);

    let mut xs = Vec::new();
    let mut ys = Vec::new();
    let mut count = 0usize;
    let mut flag = false;
    let mut basex = 0;
    let mut basey = 0;
    for c in s.chars() {
        if c == 'T' {
            if flag {
                ys.push(2*count);
                basey += count;
            } else {
                xs.push(2*count);
                basex += count;
            }
            flag = !flag;
            count = 0;
        } else {
            count += 1;
        }
    }
    if flag {
        ys.push(2*count);
        basey += count;
    } else {
        xs.push(2*count);
        basex += count;
    }

    xs.remove(0);
    let x = x-basex as isize;
    let y = y-basey as isize;
    if x > 0 || y > 0 {
        println!("No");
        return;
    }
    let x = -x as usize;
    let y = -y as usize;

    let mut dpx = vec![vec![false; x+1]; xs.len()+1];
    let mut dpy = vec![vec![false; y+1]; ys.len()+1];

    dpx[0][0] = true;
    dpy[0][0] = true;

    for i in 0..xs.len() {
        for j in 0..x+1 {
            if xs[i] > j {
                dpx[i+1][j] = dpx[i][j];
                continue;
            }
            dpx[i+1][j] = dpx[i][j]|dpx[i][j-xs[i]];
        }
    }
    for i in 0..ys.len() {
        for j in 0..y+1 {
            if ys[i] > j {
                dpy[i+1][j] = dpy[i][j];
                continue;
            }
            dpy[i+1][j] = dpy[i][j]|dpy[i][j-ys[i]];
        }
    }

    if dpx[xs.len()][x] && dpy[ys.len()][y] {
        println!("Yes");
    } else {
        println!("No");
    }
}


Measured memory_bytes: 31100