/* -*- coding: utf-8 -*-
 *
 * 1778.cc:  No.1778 括弧列クエリ / Bracketed Sequence Query - yukicoder
 */

#include<cstdio>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 200000;
const int MAX_M = MAX_N / 2 + 1;
const int BN = 17;

/* typedef */

/* global variables */

char s[MAX_N + 4];
int svs[MAX_N];
int ls[MAX_M], rs[MAX_M], ps[MAX_M][BN], ds[MAX_M], cis[MAX_M];

/* subroutines */

int find_lca(int u, int v) {
  if (ds[u] > ds[v]) swap(u, v);

  for (int i = BN - 1; i >= 0; i--)
    if (((ds[v] - ds[u]) >> i) & 1) v = ps[v][i];
  if (u == v) return u;

  for(int i = BN - 1; i >= 0; i--)
    if (ps[u][i] != ps[v][i])
      u = ps[u][i], v = ps[v][i];
  return ps[u][0];
}

/* main */

int main() {
  int n, qn;
  scanf("%d%d%s", &n, &qn, s);

  ls[0] = rs[0] = -1;
  ps[0][0] = -1, ds[0] = 0;
  int m = 1;
  for (int u = 0, i = 0; i < n && u >= 0; i++) {
    if (s[i] == '(') {
      int v = m++;
      ps[v][0] = u;
      ds[v] = ds[u] + 1;
      ls[v] = i;
      svs[i] = v;
      u = v;
    }
    else {
      rs[u] = i;
      svs[i] = u;
      u = ps[u][0];
    }
  }
  //for (int u = 0; u < m; u++)
  //printf("%d: (%d,%d), p=%d\n", u, ls[u], rs[u], ps[u][0]);
  //for (int i = 0; i < n; i++) printf("%d ", svs[i]); putchar('\n');

  for (int k = 0; k < BN - 1; k++)
    for (int u = 0; u < m; u++)
      ps[u][k + 1] = (ps[u][k] >= 0) ? ps[ps[u][k]][k] : -1;

  while (qn--) {
    int xi, yi;
    scanf("%d%d", &xi, &yi);
    xi--, yi--;

    int u = svs[xi], v = svs[yi];
    int w = find_lca(u, v);

    if (w == 0) puts("-1");
    else printf("%d %d\n", ls[w] + 1, rs[w] + 1);
  }

  return 0;
}