#include <bits/stdc++.h>
#ifdef HIRO
#define d(f_, ...) printf((f_), ##__VA_ARGS__)
#else
#define d(f_, ...)
#endif

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pllll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector< pair<int, int> > vii;
typedef vector< pair<long long, long long> > vllll;
typedef map<int, int> mii;
typedef map<long long, long long> mllll;
typedef queue<int> qi;
typedef queue< pair<int, int> > qp;
#define mp make_pair
#define pi 3.14159265358979323846
#define MAX max_element
#define MIN min_element
#define all(v) v.begin(), v.end()
#define gt(T) greater<T>()
#define sum(v) accumulate(v.begin(), v.end(), 0ll)
#define uni(v) do{ \
  sort(v.begin(), v.end()); \
  decltype(v)::iterator result = unique(v.begin(), v.end()); \
  v.erase(result, v.end()); \
}while(0)
#define fi(init, n) for(int i = init; i < n; ++i)
#define fj(init, n) for(int j = init; j < n; ++j)
#define fk(init, n) for(int k = init; k < n; ++k)
#define zero(x) memset(x, 0, sizeof(x))
#define negative(x) memset(x, ~0, sizeof(x))
#define bitsum(x) __builtin_popcount(x)
const ll MOD = 1e9 + 7;
const int INF = 1e9;
const int di[] = { 0, 1, 0, -1 };
const int dj[] = { 1, 0, -1, 0 };

template<typename T>
T gcd(T a, T b) {
	return b ? gcd(b, a % b) : a;
}
template<typename T>
T lcm(T a, T b) {
	return a / gcd(a, b) * b;
}
template<typename T>
int finder(vector<T> vec, T number) {
	auto itr = find(vec.begin(), vec.end(), number);
	size_t index = distance(vec.begin(), itr);
	if (index != vec.size()) return 1;
	else return 0;
}
ll frac(ll n){
	if (n == 0) return 1;
	return (n * frac(n - 1)) % MOD;
}
template<class T> inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template<class T> inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

int main(int argc, char** argv) {
#ifdef HIRO
  string quiz(argv[1]);
  string id(argv[2]);
  string filename("input/" + quiz + "/" + id + ".txt");
  ifstream fin(filename);
  if (fin.peek() == ifstream::traits_type::eof()) {
    cout << "No input.";
    return 0;
  }
  ifstream cin(filename);
  std::cin.rdbuf(cin.rdbuf());
#endif
  // times in a pair: max(R, L) - 1
  //
  // R R L
  //   2 1      (1 time
  //
  // R L L
  // 1 2        (1 time
  //
  // R R L L
  //   2 2      (1 time
  //
  // R R R L
  //     2 2    (2 times
  //
  // R L L L
  // 2 2        (2 times
  //
  // R R R L L
  //     3 2    (2 times
  //
  // R R R R L L
  //       3 3  (3 times
  //
  // R R R R R L
  //         3 3 (4 times
  //
  // R R R R L L L
  //       4 3  (3 times
  //
  // R R R R L
  //       3 2  (3 times
  //
  // R R R R R L L
  //         4 3 (4 times
  string s;
  cin >> s;
  int n = s.size();
  vi v(n);
  int rs = -1, re = -1, ls = -1, le = -1;
  fi(0, n) {
    if(i == n - 1) {
      le = i;
      if(s[i - 1] == 'R') {
        re = i - 1;
        ls = i;
      }
    }
    else if(s[i] == 'R' && rs == -1) {
      rs = i;
      continue;
    }
    else if(s[i] == 'L' && ls == -1) {
      ls = i;
      re = i - 1;
      continue;
    }
    else if(s[i] == 'R' && ls != -1) {
      le = i - 1;
    }
    else
      continue;
    int rsum = re - rs + 1;
    int lsum = le - ls + 1;
    v[re] = v[ls] = (rsum + lsum) / 2;
    if((rsum + lsum) % 2) {
      if(rsum > lsum)
        v[re]++;
      else
        v[ls]++;
      // As 10 ^ 100 is even, pairs of odd times should swap
      if((max(rsum, lsum) - 1) % 2)
        swap(v[re], v[ls]);
    }
    rs = i;
    re = ls = le = -1;
  }
  
  for(int x: v) {
    cout << x << " ";
  }
  return 0;
}



Measured memory_bytes: 1024