using System;
using System.Collections.Generic;
using System.Linq;

class G
{
	static int[] Read() => Array.ConvertAll(Console.ReadLine().Split(), int.Parse);
	static (int x, int y) Read2() { var a = Read(); return (a[0], a[1]); }
	static void Main() => Console.WriteLine(Solve());
	static object Solve()
	{
		var (n, qc) = Read2();
		var s = Console.ReadLine();
		var qs = Array.ConvertAll(new bool[qc], _ => Read2());

		// 対
		var pair = new int[n + 1];
		var st = new Stack<int>();

		for (int i = 1; i <= n; i++)
		{
			if (s[i - 1] == '(')
			{
				st.Push(i);
			}
			else
			{
				var l = st.Pop();
				pair[l] = i;
				pair[i] = l;
			}
		}

		for (int qi = 0; qi < qc; qi++)
		{
			var (x, y) = qs[qi];

			var xl = Math.Min(x, pair[x]);
			var xr = Math.Max(x, pair[x]);
			var yl = Math.Min(y, pair[y]);
			var yr = Math.Max(y, pair[y]);

			qs[qi] = (Math.Min(xl, yl), Math.Max(xr, yr));
		}

		var map = Array.ConvertAll(new bool[n + 1], _ => new List<int>());
		foreach (var qi in Enumerable.Range(0, qc).OrderBy(qi => qs[qi].x))
		{
			var y = qs[qi].y;
			map[y].Add(qi);
		}

		var r = new (int l, int r)[qc];

		for (int i = 1; i <= n; i++)
		{
			if (s[i - 1] == '(') continue;

			foreach (var qi in map[i])
				st.Push(qi);

			while (st.Count > 0)
			{
				var qi = st.Peek();

				if (pair[i] <= qs[qi].x)
				{
					st.Pop();
					r[qi] = (pair[i], i);
				}
				else
				{
					break;
				}
			}
		}

		return string.Join("\n", r.Select(p => p.l == 0 ? "-1" : $"{p.l} {p.r}"));
	}
}