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.
The input consists of only one line. The only line contains the string *s* (1 ≤ |*s*| ≤ 10<sup class="upper-index">6</sup>). Each character in *s* will be either "l" or "r".
t = int(input())
k = []
x = []
for i in range(t):
    line = input().split()
    k.append(int(line[0]))
    x.append(int(line[1]))

def calculate(num, mx):
    if num <= mx:
        return int(num * (1 + (num - 1) / 2))
    num = 2 * mx - num - 1
    return mx ** 2 - int((1 + (num - 1) / 2) * num)

for i in range(t):
    st = 0
    en = k[i] * 2 - 1
    if k[i] == 1:
        print(1)
        continue
    while st < en:
        md = (en + st) // 2
        if calculate(md, k[i]) >= x[i]:
            #print("vrejjjj")
            en = md
        else:
            st = md + 1
    print(st)

#print(calculate(1, 100))