from bisect import bisect_left

def rmq_update(t, i, val, f=min):
	t[i + len(t) // 2] = val
	i = (i + len(t) // 2) // 2
	while i > 0:
		t[i] = f(t[i * 2], t[i * 2 + 1])
		i //= 2
def rmq_query(t, l, r, f=min, def_val=0x7fffffff):
	i, j, a, b = l + len(t) // 2, r + len(t) // 2, def_val, def_val
	while i < j:
		if i % 2 != 0: a = f(a, t[i]); i += 1
		if j % 2 != 0: j -= 1; b = f(b, t[j])
		i, j = i // 2, j // 2
	return f(a, b)

N, Q = map(int, input().split())
s = input().strip()
p = [0] * N
st = []
for i, x in enumerate(s):
	if x == '(':
		st.append(i)
	else:
		p[i] = st[-1]
		p[st[-1]] = i
		st.pop()
a = [(i, p[i]) for i, x in enumerate(s) if x == '(']
t1, t2 = [N] * (N * 2), [-1] * (N * 2)
for i, x in enumerate(p):
	rmq_update(t1, i, x, min)
	rmq_update(t2, i, x, max)

for _ in range(Q):
	x, y = map(int, input().split())
	x -= 1; y -= 1
	if x > y: x, y = y, x
	l = min(rmq_query(t1, x, y + 1, min, N), x)
	r = max(rmq_query(t2, x, y + 1, max, 0), y)
	i = bisect_left(a, (l, r))
	while i < len(a) and i >= 0:
		if a[i][0] <= l and a[i][1] >= r: break
		i -= 1
	if i < 0 or i >= len(a): print(-1)
	else: print(a[i][0] + 1, a[i][1] + 1)