import java.io.IOException;
import java.io.InputStream;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.BitSet;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.NoSuchElementException;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeMap;
import java.util.TreeSet;

public class Main {

	static Scanner sc = new Scanner(System.in);

	static class FastScanner {
		private final InputStream in;
		private final byte[] buffer = new byte[1024];
		private int ptr = 0;
		private int buflen = 0;

		public FastScanner(InputStream source) {
			in = source;
		}

		private boolean hasNextByte() {
			if (ptr < buflen) {
				return true;
			} else {
				ptr = 0;
				try {
					buflen = in.read(buffer);
				} catch (IOException e) {
					e.printStackTrace();
				}
				if (buflen <= 0) {
					return false;
				}
			}
			return true;
		}

		private int readByte() {
			if (hasNextByte())
				return buffer[ptr++];
			else
				return -1;
		}

		private static boolean isPrintableChar(int c) {
			return 33 <= c && c <= 126;
		}

		public boolean hasNext() {
			while (hasNextByte() && !isPrintableChar(buffer[ptr]))
				ptr++;
			return hasNextByte();
		}

		public String next() {
			if (!hasNext())
				throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (isPrintableChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}

		public long nextLong() {
			if (!hasNext())
				throw new NoSuchElementException();
			long n = 0;
			boolean minus = false;
			int b = readByte();
			if (b == '-') {
				minus = true;
				b = readByte();
			}
			if (b < '0' || '9' < b) {
				throw new NumberFormatException();
			}
			while (true) {
				if ('0' <= b && b <= '9') {
					n *= 10;
					n += b - '0';
				} else if (b == -1 || !isPrintableChar(b)) {
					return minus ? -n : n;
				} else {
					throw new NumberFormatException();
				}
				b = readByte();
			}
		}

		public int nextInt() {
			long nl = nextLong();
			if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
				throw new NumberFormatException();
			return (int) nl;
		}

		public double nextDouble() {
			return Double.parseDouble(next());
		}
	}

	/**
	 * Compute n! mod. p, (n!)^(-1) mod.p
	 *
	 * @param fac[]
	 *            : n! mod. p
	 * @param finv[]
	 *            : (n!)^(-1) mod. p
	 * @param MAX
	 *            :
	 * @param MOD
	 *            :
	 */

	static void hz_COMinit(long fac[], long finv[], long inv[], final int MAX, final long MOD) {
		fac[0] = fac[1] = 1L;
		finv[0] = finv[1] = 1L;
		inv[1] = 1L;
		for (int i = 2; i < MAX; i++) {
			fac[i] = fac[i - 1] * i % MOD;
			inv[i] = MOD - inv[(int) (MOD % i)] * (MOD / i) % MOD;
			finv[i] = finv[i - 1] * inv[i] % MOD;
		}
	}
	/*
	 * static void hz_COMinit(long fac[], long finv[], long inv[],final int MAX,
	 * final long MOD) { fac[0] = fac[1] = 1L; finv[0] = finv[1] = 1L; inv[1] =
	 * 1L; for (int i = 2; i < MAX; i++){ fac[i] = (BigInteger.valueOf(fac[i -
	 * 1]).multiply(BigInteger.valueOf(i)).mod(BigInteger.valueOf(MOD))).
	 * longValue(); inv[i] =
	 * (BigInteger.valueOf(MOD).subtract(BigInteger.valueOf(inv[(int)(MOD%i)]).
	 * multiply(BigInteger.valueOf(MOD/i)).mod(BigInteger.valueOf(MOD)))).
	 * longValue(); finv[i] = (BigInteger.valueOf(finv[i -
	 * 1]).multiply(BigInteger.valueOf(inv[i])).mod(BigInteger.valueOf(MOD))).
	 * longValue(); } }
	 */

	/**
	 * @Compute nCk(二項係数計算) mod. p
	 * @param fac[]
	 *            : n! mod. p
	 * @param finv[]
	 *            : (n!)^(-1) mod. p
	 * @return :nCk(二項係数計算) mod. p
	 */
	static long hz_COM(long fac[], long finv[], int n, int k, final long MOD) {
		if (n < k)
			return 0;
		if (n < 0 || k < 0)
			return 0;
		return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
	}
	/*
	 * static long hz_COM(long fac[],long finv[], int n, int k, final long MOD){
	 * if (n < k) return 0; if (n < 0 || k < 0) return 0; return
	 * BigInteger.valueOf(fac[n]) .multiply(BigInteger.valueOf(finv[k])
	 * .multiply(BigInteger.valueOf(finv[n - k])) .mod(BigInteger.valueOf(MOD))
	 * ) .mod(BigInteger.valueOf(MOD)).longValue(); }
	 */

	static int hz_swap(int a, int b) {
		if (a >= b)
			return a;
		else
			return b;
	}

	static long hz_swap(long a, long b) {
		if (a >= b)
			return a;
		else
			return b;
	}

	// mod上での差分
	static long hz_modSub(long a, long b, long mod) {
		long v = a - b;
		if (v < 0)
			v += mod;
		return v % mod;
	}

	// mod上での割算
	static long hz_modDiv(long a, long b, long mod) {
		return (a % mod) * hz_modInv(b, mod) % mod;
	}

	// 逆元
	static long hz_modInv(long a, long mod) {
		return hz_modPow(a, mod - 2L, mod);
	}

	// mod上での累乗
	static long hz_modPow(long n, long k, long mod) {

		long result = 1L;

		// k を右シフトしつつ n を 2 乗していく
		while (k > 0L) {
			// k の最下ビットが 1 なら、今の n を答えに掛ける
			if ((k & 1L) == 1L)
				result = (result * n) % mod;
			n = n * n % mod;
			k >>= 1L;
		}

		return result;
	}

	// Union Find Tree
	static class HZ_UF {

		public int[] par;
		public int[] rank;

		public HZ_UF(int n) {
			this.par = new int[n + 1];
			this.rank = new int[n + 1];

			Arrays.fill(par, -1);
			Arrays.fill(rank, 0);
		}

		public void unite(int x, int y) {
			link(root(x), root(y));
		}

		public boolean link(int x, int y) {
			if (x == y)
				return false;
			if (rank[x] > rank[y]) {
				par[x] += par[y];
				par[y] = x;
			} else {
				par[y] += par[x];
				par[x] = y;
				if (rank[x] == rank[y])
					rank[y]++;
			}
			return true;
		}

		public boolean isSame(int x, int y) {
			return root(x) == root(y);
		}

		public int root(int x) {
			if (par[x] < 0)
				return x;
			else
				return x = root(par[x]);
		}

		public int size(int x) {
			return -par[root(x)];
		}
	}

	public static void main(String[] args) {

		solve_abc136_d();
	}
  
  	public static void solve_abc136_d() {

		FastScanner sc = new FastScanner(System.in);
		
		//Read Input -> String
		String s = sc.next();
		
		//String length sl
		int sl = s.length();
		char nowc = 'x';
		char prvc = 'x';
		
		int iFin = -1;			//index of Final R
		int iFinL = -1;		//index of Final L
		int iStart = sl-1;		//index of Start L
		int iStartR = 0;		//index of Start R
		
		int cR = 0;	//countR
		int cL = 0;	//countL
		
		int[] ans = new int[sl];
		
		

		
		
		//for i=0->sl-1
		for(int i=0;i<sl;i++){
			prvc = nowc;
			nowc = s.charAt(i);
		
			//if now==L prv==R
				//rec finalR=prv, start=now
			if(prvc =='R' && nowc == 'L' ){
				iFin = i-1;
				cR = iFin - iStartR + 1;
				iStart = i;
			}
			
//			System.out.println(i + "\tiStartR:" + iStartR + "\tiFinR:" + iFin + "\tiStartL:" + iStart + "\tiFin:" + iFinL);
		
			//if (now==R, prv==L) OR (i==sl-1)
			if((prvc =='L' && nowc == 'R' ) || (i == sl-1)){
				iFinL = i-1;
				
				//if i==sl-1	cL++;
				if(i == sl-1) iFinL++;
				
				cL = iFinL - iStart + 1;
		
				//if (cR + cL) % 2 == 0
				if((cR + cL) % 2 == 0){
					//ans[finalR] = ans[startL] = (cR+cL) / 2
					if(iFin != -1) ans[iFin] = (cR + cL) /2;
					ans[iStart] = (cR+cL) / 2;
				}
				//if (cR + cL) % 2 != 0
				else {
					int idxMore =0;
					int idxLess = 0;

					//System.out.println(i + "\tiStartR:" + iStartR + "\tiFinR:"
					//		+ iFin + "\tiStartL:" + iStart + "\tiFin:" + iFinL + "\tcR:" + cR + "\tcL" + cL );
					
					//if cR > cL
						//idxMore = finalR, idxLess = startL
					/*
					if(cR > cL) {
						idxMore = iFin;
						idxLess = iStart;
					}
					//else
					else{
						//idxMore = startL, idxLess = finalR
						idxMore = iStart;
						idxLess = iFin;
					}
					*/
					boolean rev;
					
					if(Math.max(cR, cL) % 2 == 0) rev = true;
					else rev = false;
					
					if(rev){
						int tmp = cR;
						cR = cL;
						cL = tmp;
					}
					
					if(cR > cL) {
						idxMore = iStart;
						idxLess = iFin;
					}
					else{
						//idxMore = startL, idxLess = finalR
						idxMore = iFin;
						idxLess = iStart;
					}
		
					//ans[idxMore] = (cR+cL) / 2, ans[idxLess] = (cR+cL) / 2 + 1
					ans[idxMore] = (cR+cL) / 2;
					ans[idxLess] = (cR+cL) / 2 + 1;

				}
				//cR = 1, cL = 0
				//cR = 1;
				//cL = 0;
				iStartR = i;
		
			}
			//else now==R cR++;
			//else if(nowc == 'R') cR++;
			//else(now==L) cL++;
			//else cL++;
		}
		
		//for(i=0->sl-1) print(ans[i])
		StringBuilder sb = new StringBuilder();
		sb.append(ans[0]);
		for(int i=1;i<sl;i++) sb.append(" " + ans[i]);
		System.out.println(sb);
	}
}

Measured memory_bytes: 45584