def int_input():
    return map(int,input().split())
n, q = int_input()
s = input()

qs = [tuple(int_input()) for _ in range(q)]

pairs_b = [()] * (n + 1)
pairs_t = [()] * (n + 1)
singles = []

for i in range(n):
    if s[i] == "(":
        singles.append(i)
    else:
        a = singles.pop(-1) + 1
        pairs_b[a] = (a, i + 1)
        pairs_t[i + 1] = (a, i + 1)

def ret_pairs(x):
    if len(pairs_b[x]) != 0:
        return pairs_b[x]
    else:
        return pairs_t[x]

def find_min_including_set(qs):
    x = ret_pairs(qs[0])
    y = ret_pairs(qs[1])
    bottom = min(x[0], y[0])
    top = max(x[1], y[1])
    for i in range(bottom):
        j = bottom - i
        candidate = pairs_b[j]
        if candidate[1] >= top:
            return candidate

for i in qs:
    ans = find_min_including_set(i)
    if ans:
        print(*ans)
    else:
        print(-1)