class LCA:
	def __init__(self, g, root=0):
		n, self.g, self.tick, self.anc, m = len(g), g, 0, [], len(g)
		self.tin, self.tout, self.pos, self.d, self.par = [0] * n, [0] * n, [0] * n, [0] * n, [-1] * n
		while m != 0: self.anc.append([0] * n); m //= 2
		def dfs(u):
			self.pos[self.tick] = u
			self.tin[u] = self.tick
			self.tick += 1
			self.anc[0][u] = max(self.par[u], 0)
			for i in range(1, len(self.anc)):
				self.anc[i][u] = self.anc[i - 1][self.anc[i - 1][u]]
			for v in self.g[u]:
				if self.par[u] != v:
					self.par[v] = u
					self.d[v] = self.d[u] + 1
					dfs(v)
			self.tout[u] = self.tick
		dfs(root)
	def is_ancestor(self, u, v):
		return self.tin[u] <= self.tin[v] and self.tout[u] >= self.tout[v]
	def lca(self, u, v):
		if self.is_ancestor(u, v): return u
		if self.is_ancestor(v, u): return v
		for i in range(len(self.anc) - 1, -1, -1):
			if not self.is_ancestor(self.anc[i][u], v): u = self.anc[i][u]
		return self.anc[0][u]
	def dist(self, u, v):
		return 0 if u == v else self.d[u] + self.d[v] - self.d[self.lca(u, v)] * 2
	def kth(self, u, k):	# k-th parent
		if k > self.d[u]: return -1
		i = 0
		while k > 0:
			if (k & 1) != 0: u = self.anc[i][u]
			k, i = k >> 1, i + 1
		return u

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)]

def build(u, c):
	if c <= 2: return
	v = u + 1
	while v < u + c and p[v] > 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(min(x, p[x]), min(y, p[y]))
	if t == 0: print(-1)
	else: print(t, p[t])