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

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

pairs = {}
singles = []

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

def find_min_including_set(qs):
    x = pairs[qs[0]]
    y = pairs[qs[1]]
    bottom = min(x[0], y[0])
    top = max(x[1], y[1])
    dis_b = bottom
    dis_t = n + 1 - top
    dis = min(dis_b, dis_t)
    for i in range(dis):
        j = bottom - i
        candidate_b = pairs[j]
        if candidate_b[1] >= top:
            return candidate_b
        k = top + i
        candidate_t = pairs[k]
        if candidate_t[0] <= bottom:
            return candidate_t

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