#[derive(Default)]
//NOTE
//declare variables to reduce the number of parameters for dp and dfs etc.
struct Solver {}

impl Solver {
    fn solve(&mut self) {
        let stdin = std::io::stdin();
        let mut scn = Scanner {
            stdin: stdin.lock(),
        };
        let s = scn.chars();
        let n = s.len();
        let mut r = vec![(0, 0); n];
        let mut l = vec![(0, 0); n];
        for (idx, x) in s.iter().enumerate() {
            if *x == 'R' {
                r[idx] = (1, 0);
            } else {
                l[idx] = (1, 0);
            }
        }
        for (idx, x) in s.windows(2).enumerate() {
            let (p1, p2) = (x[0], x[1]);
            //eprintln!("{:?} {:?}", idx, x);
            if p1 == 'R' && p2 == 'R' {
                r[idx + 1] = (1 + r[idx].1, r[idx].0);
                r[idx] = (0, 0);
            }
        }
        for (idx, x) in s.windows(2).enumerate().rev() {
            let (p1, p2) = (x[0], x[1]);
            //eprintln!("{:?}", x);
            if p1 == 'L' && p2 == 'L' {
                l[idx] = (1 + l[idx + 1].1, l[idx + 1].0);
                l[idx + 1] = (0, 0);
            }
        }
        //eprintln!("{:?}", r);
        //eprintln!("{:?}", l);

        let mut results = vec![0; n];
        for i in 0..n {
            results[i] += r[i].0;
            results[i] += l[i].0;
            if i + 1 < n {
                results[i] += l[i + 1].1;
                results[i + 1] += r[i].1;
            }
        }
        for x in 0..n {
            print!("{} ", results[x]);
        }
        println!();
    }
}

fn main() {
    std::thread::Builder::new()
        .stack_size(64 * 1024 * 1024) // 64MB
        .spawn(|| {
            let mut solver = Solver::default();
            solver.solve()
        })
        .unwrap()
        .join()
        .unwrap();
}
pub mod utils {
    const DYX: [(isize, isize); 8] = [
        (0, 1),   //right
        (1, 0),   //down
        (0, -1),  //left
        (-1, 0),  //top
        (1, 1),   //down right
        (-1, 1),  //top right
        (1, -1),  //down left
        (-1, -1), //top left
    ];

    pub fn try_adj(y: usize, x: usize, dir: usize, h: usize, w: usize) -> Option<(usize, usize)> {
        let ny = y as isize + DYX[dir].0;
        let nx = x as isize + DYX[dir].1;
        if ny >= 0 && nx >= 0 {
            let ny = ny as usize;
            let nx = nx as usize;
            if ny < h && nx < w {
                Some((ny, nx))
            } else {
                None
            }
        } else {
            None
        }
    }
}

//snippet from kenkoooo
pub struct Scanner<R> {
    stdin: R,
}

impl<R: std::io::Read> Scanner<R> {
    pub fn read<T: std::str::FromStr>(&mut self) -> T {
        use std::io::Read;
        let buf = self
            .stdin
            .by_ref()
            .bytes()
            .map(|b| b.unwrap())
            .skip_while(|&b| b == b' ' || b == b'\n' || b == b'\r')
            .take_while(|&b| b != b' ' && b != b'\n' && b != b'\r')
            .collect::<Vec<_>>();
        unsafe { std::str::from_utf8_unchecked(&buf) }
            .parse()
            .ok()
            .expect("Parse error.")
    }
    pub fn read_line(&mut self) -> String {
        use std::io::Read;
        let buf = self
            .stdin
            .by_ref()
            .bytes()
            .map(|b| b.unwrap())
            .skip_while(|&b| b == b'\n' || b == b'\r')
            .take_while(|&b| b != b'\n' && b != b'\r')
            .collect::<Vec<_>>();
        unsafe { std::str::from_utf8_unchecked(&buf) }
            .parse()
            .ok()
            .expect("Parse error.")
    }
    pub fn vec<T: std::str::FromStr>(&mut self, n: usize) -> Vec<T> {
        (0..n).map(|_| self.read()).collect()
    }

    pub fn chars(&mut self) -> Vec<char> {
        self.read::<String>().chars().collect()
    }
}


Measured memory_bytes: 10748