#include <bits/stdc++.h>
using namespace std;
struct List {
  List *Next;
  List *Prev;
  int val;
};
void InsertAfter(List *pos, int v) {
  List *temp = pos->Next;
  List *g = (List *)malloc(sizeof(List));
  g->val = v;
  g->Next = temp;
  g->Prev = pos;
  pos->Next = g;
  if (g->Next != NULL) {
    g->Next->Prev = g;
  }
}
void InsertBefore(List **Head, List *pos, int v) {
  if (pos != *Head) {
    pos = pos->Prev;
    InsertAfter(pos, v);
  } else {
    List *g = (List *)malloc(sizeof(List));
    g->Next = *Head;
    if (*Head != NULL) (*Head)->Prev = g;
    g->val = v;
    pos = (*Head) = g;
  }
}
int main() {
  static char s[1000100];
  gets(s);
  List *Head = NULL;
  List *p = NULL;
  InsertBefore(&Head, p, 1);
  p = Head;
  int k = strlen(s);
  for (int i = 1; i < k; i++) {
    if (s[i - 1] == 'l') {
      InsertBefore(&Head, p, i + 1);
      p = p->Prev;
    } else {
      InsertAfter(p, i + 1);
      p = p->Next;
    }
  }
  for (int i = 0; i < k; i++) {
    printf("%d\n", Head->val);
    Head = Head->Next;
  }
  return 0;
}
