#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
const int mod = 1e9+7;
#define yes cout << "Yes" << endl;
#define no cout << "No" << endl;

// inv b = mod-2

int binpow(int a, int b)
{
    int res = 1;
    a = a % mod;
    while (b != 0)
    {
        if (b & 1)
        {
            res = (res * a) % mod;
        }
        a = (a * a) % mod;
        b = b >> 1;
    }
    return res;
}

void solve()
{   
    string s;
    cin>>s;
    int n = s.length();

    vector<int> cnt(n,0);
    int last = -1;
    for(int i=n-1;i>=0;i--){
        if(s[i]=='L'){
            last = i;
        }
        else{
            int kk = (last-i);
            if(kk%2){
                cnt[last-1]++;
            }
            else{
                cnt[last]++;
            }
        }
    }

    for(int i=0;i<n;i++){
        if(s[i]=='R'){
            last = i;
        }
        else{
            int kk = (i-last);
            if(kk%2){
                cnt[last+1]++;
            }
            else{
                cnt[last]++;
            }
        }
    }

    for(int i=0;i<n;i++){
        cout<<cnt[i];
    }
    cout<<endl;

    return;
}

signed main()
{
    ios::sync_with_stdio(false);
    cout.tie(0);
    cin.tie(0);
    int t = 1;
     cin >> t;
    while (t-- != 0)
    {

        solve();
    }
    return 0;
}