def mpow(n, p, mod)
  r = 1
  while p > 0
    r = r * n % mod if p & 1 == 1
    n = n * n % mod
    p >>= 1
  end
  r
end

str = gets.chomp

l = str.length
box = Array.new(l, 1)

doit = ->{
  nxt = Array.new(l, 0)
  str.each_char.with_index do |c, i|
    if c == "R"
      nxt[i + 1] += box[i]
    else
      nxt[i - 1] += box[i]
    end
  end
  box = nxt
}

stack = [box.join]
idx = nil

loop do
  doit.()
  tmp = box.join.rjust(l, "0")
  break if (idx = stack.index(tmp))
  stack << tmp
end

ln = stack.size - idx
i = idx + (mpow(10, 100, ln) - idx % ln) % ln

puts stack[i].chars.join(" ")