Squirrel Liss lived in a forest peacefully, but unexpected trouble happens. Stones fall from a mountain. Initially Squirrel Liss occupies an interval [0, 1]. Next, n stones will fall and Liss will escape from the stones. The stones are numbered from 1 to n in order.

The stones always fall to the center of Liss's interval. When Liss occupies the interval [k - d, k + d] and a stone falls to k, she will escape to the left or to the right. If she escapes to the left, her new interval will be [k - d, k]. If she escapes to the right, her new interval will be [k, k + d].

You are given a string s of length n. If the i-th character of s is "l" or "r", when the i-th stone falls Liss will escape to the left or to the right, respectively. Find the sequence of stones' numbers from left to right after all the n stones falls.

Input

The input consists of only one line. The only line contains the string s (1 ≤ |s| ≤ 106). Each character in s will be either "l" or "r".

Output

Output n lines — on the i-th line you should print the i-th stone's number from the left.

Examples

Input

llrlr


Output

3
5
4
2
1


Input

rrlll


Output

1
2
5
4
3


Input

lrlrr


Output

2
4
5
3
1

Note

In the first example, the positions of stones 1, 2, 3, 4, 5 will be <image>, respectively. So you should print the sequence: 3, 5, 4, 2, 1.
//package codeforces;

import java.io.BufferedWriter;
import java.io.IOException;
import java.io.StreamTokenizer;
import java.io.DataInputStream;
import java.io.InputStream;
import java.io.PrintWriter;

public class Codeforces {

    public void run() throws IOException {
        Parser sc = new Parser(System.in);
        String s = sc.nextString(1000000);
        PrintWriter pw = new PrintWriter(System.out);
        BufferedWriter out = new BufferedWriter(pw);
        int n = s.length();
        int[] m = new int[n];
        int l = 0, r = n - 1;
        for (int i = 0; i < n; i++) {
            char c = s.charAt(i);
            if (c == 'l') {
                m[l] = i + 1;
                l++;
            } else {
                m[r] = i + 1;
                r--;
            }
        }
        for (int i = 0; i < n; i++) {
            out.write(Integer.toString(m[n - 1 - i]));
            out.newLine();
        }
        out.close();
    }

    public static void main(String[] args) throws IOException {
        Codeforces cf = new Codeforces();
        cf.run();
    }
}

class MyScanner {

    private StreamTokenizer st;

    public MyScanner(InputStream is) {
        st = new StreamTokenizer(is);
    }

    public int nextInt() throws IOException {
        st.nextToken();
        return ((int) st.nval);
    }
}

class Parser {

    final private int BUFFER_SIZE = 1 << 16;
    private DataInputStream din;
    private byte[] buffer;
    private int bufferPointer, bytesRead;

    public Parser(InputStream in) {
        din = new DataInputStream(in);
        buffer = new byte[BUFFER_SIZE];
        bufferPointer = bytesRead = 0;
    }

    public String nextString(int maxSize) throws IOException {
        byte[] ch = new byte[maxSize];
        int point = 0;
        byte c = read();
        while (c == ' ' || c == '\n' || c == '\r') {
            c = read();
        }
        while (c != ' ' && c != '\n' && c != '\r') {
            ch[point++] = c;
            c = read();
        }
        return new String(ch, 0, point);
    }

    public int nextInt() throws IOException {
        int ret = 0;
        boolean neg;
        byte c = read();
        while (c <= ' ') {
            c = read();
        }
        neg = c == '-';
        if (neg) {
            c = read();
        }
        do {
            ret = ret * 10 + c - '0';
            c = read();
        } while (c > ' ');

        if (neg) {
            return -ret;
        }
        return ret;
    }

    public long nextLong() throws IOException {
        long ret = 0;
        boolean neg;
        byte c = read();
        while (c <= ' ') {
            c = read();
        }
        neg = c == '-';
        if (neg) {
            c = read();
        }
        do {
            ret = ret * 10 + c - '0';
            c = read();
        } while (c > ' ');

        if (neg) {
            return -ret;
        }
        return ret;
    }

    private void fillBuffer() throws IOException {
        bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
        if (bytesRead == -1) {
            buffer[0] = -1;
        }
    }

    private byte read() throws IOException {
        if (bufferPointer == bytesRead) {
            fillBuffer();
        }
        return buffer[bufferPointer++];
    }
}