// No.1778 括弧列クエリ / Bracketed Sequence Query
#include <bits/stdc++.h>

using namespace std;

struct LCA {
	vector<int> r, p, d, t, q;
	LCA(const vector<vector<int>> &e, int root = 0) : t(e.size()), d(e.size()), q(e.size() * 2) {
		int n = e.size(), tick = 0;
		function<void(int, int)> dfs = [&](int u, int par) {
			t[u] = tick++;
			for (auto v : e[u]) if (v != par) d[v] = d[u] + 1, p.push_back(u), r.push_back(t[u]), dfs(v, u);
		};
		dfs(root, -1);
		for (int i = 0; i < r.size(); i++) {
			q[i + n] = r[i];
			for (int j = i + n; j /= 2; ) q[j] = min(q[j * 2], q[j * 2 + 1]);
		}
	}
	int rmq(int l, int r) {
		int n = q.size() / 2, a = INT_MAX, b = INT_MAX;
		for (int i = l + n, j = r + n; i < j; i /= 2, j /= 2) {
			if (i % 2) a = min(a, q[i++]);
			if (j % 2) b = min(b, q[--j]);
		}
		return min(a, b);
	}
	int lca(int u, int v) { return u == v ? u : p[rmq(min(t[u], t[v]), max(t[u], t[v]))]; }
};

int main(int argc, char *argv[])
{
	cin.tie(0)->sync_with_stdio(0);
	int n, q;
	string s;
	cin >> n >> q >> s;
	s = "(" + s + ")";
	n += 1;
	vector<int> p(n), st;
	for (int i = 0; i < n; i++)
		if (s[i] == '(') st.push_back(i);
		else p[i] = st.back(), p[st.back()] = i, st.pop_back();
	vector<vector<int>> g(n);
	function<void(int, int)> build = [&](int u, int c) {
		if (c <= 2) return;
		for (int v = u + 1; v < u + c && p[v] > v; v = p[v] + 1)
			g[u].push_back(v), build(v, p[v] - v + 1);
	};
	build(0, n);
	auto lca = LCA(g);
	while (q--) {
		int x, y;
		cin >> x >> y;
		auto t = lca.lca(min(x, p[x]), min(y, p[y]));
		if (t == 0) cout << -1 << "\n";
		else cout << t << ' ' << p[t] << "\n";
	}

	return 0;
}