class LCA:
	def __init__(self, g, root=0):
		n, r, self.tick = len(g), [], 0
		self.n, self.t, self.d, self.p, self.q = n, [0] * n, [0] * n, [], [0] * (n * 2)
		def dfs(u, par):
			self.t[u] = self.tick; self.tick += 1
			for v in g[u]:
				if v != par: self.d[v] = self.d[u] + 1; self.p.append(u); r.append(self.t[u]); dfs(v, u)
		dfs(root, -1)
		for i, val in enumerate(r):
			self.q[i + n], j = val, (i + n) >> 1
			while j != 0: self.q[j] = min(self.q[j * 2], self.q[j * 2 + 1]); j >>= 1
	def rmq(self, l, r):
		i, j, a, b = l + self.n, r + self.n, float('inf'), float('inf')
		while i < j:
			if i & 1: a = min(a, self.q[i]); i += 1
			if j & 1: j -= 1; b = min(b, self.q[j])
			i, j = i // 2, j // 2
		return min(a, b)
	def lca(self, u, v):
		return u if u == v else self.p[self.rmq(min(self.t[u], self.t[v]), max(self.t[u], self.t[v]))]
	def dist(self, u, v):
		return 0 if u == v else self.d[u] + self.d[v] - self.d[self.lca(u, v)] * 2

from bisect import bisect_left

N, Q = map(int, input().split())
s = '(' + input().strip() + ')'
n = N + 2
p, st = [0] * n, []
for i, x in enumerate(s):
	if x == '(':
		st.append(i)
	else:
		p[i] = st[-1]
		p[st[-1]] = i
		st.pop()
g = [[] for _ in range(n)]
for i, x in enumerate(s):
	if s[i] == '(': g[i].append(p[i])

def build(u, c):
	if c <= 2: return
	v = u + 1
	while v < u + c and s[v] == '(':
		g[u].append(v)
		build(v, p[v] - v + 1)
		v = p[v] + 1
build(0, n)

lca = LCA(g)

for _ in range(Q):
	x, y = map(int, input().split())
	t = lca.lca(x, y)
	if t == 0: print(-1)
	else: print(t, p[t])