#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
vector<long long int> g[200001];
bool vis[200001] = {0};
bool sortinrev(const pair<long long, long long> &a,
               const pair<long long, long long> &b) {
  return (a.first > b.first);
}
int32_t main() {
  cin.tie(NULL);
  cout.tie(NULL);
  string s;
  vector<int> l, r;
  cin >> s;
  int n = s.length();
  for (int i = 0; i < n; i++) {
    if (s[i] == 'l')
      l.push_back(i + 1);
    else
      r.push_back(i + 1);
  }
  for (int i = 0; i < r.size(); i++) printf("%d\n", r[i]);
  for (int i = l.size() - 1; i >= 0; i--) printf("%d\n", l[i]);
  return 0;
}
