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

using namespace std;

struct LCA {
	vector<vector<int>> anc;	// [power][node]
	vector<int> dist, t;
	LCA(const vector<vector<int>> &e, int root = 0) : dist(e.size()) {
		anc.assign(32 - __builtin_clz(e.size()), vector<int>(e.size()));
		function<void(int, int)> dfs = [&](int u, int p) {
			anc[0][u] = max(p, 0); t.push_back(u);
			for (auto v : e[u]) if (v != p) dist[v] = dist[u] + 1, dfs(v, u);
		};
		dfs(root, -1);
		for (int k = 1; k < anc.size(); k++)
			for (int i = 0; i < anc[k].size(); i++) anc[k][i] = anc[k - 1][anc[k - 1][i]];
	}
	int operator()(int u, int v) {
		if (dist[u] < dist[v]) swap(u, v);
		for (int k = anc.size() - 1, b = dist[u] - dist[v]; k >= 0; k--)
			if (b & (1 << k)) u = anc[k][u];
		for (int k = anc.size() - 1; k >= 0; k--)
			if (anc[k][u] != anc[k][v]) u = anc[k][u], v = anc[k][v];
		return u == v ? u : anc[0][u];
	}
};

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(min(x, p[x]), min(y, p[y]));
		if (t == 0) cout << -1 << "\n";
		else cout << t << ' ' << p[t] << "\n";
	}

	return 0;
}