#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i < (n);i++)
using ll = long long;
using P =pair<int,int>;
ll INF = 1LL << 60;
int LEN = 1 << 20;
vector<int> seg(2*LEN,0);
void add(int ind,int val){
  ind += LEN;
  seg[ind] = val;
  while(ind > 0){
    ind /= 2;
    seg[ind] = max(seg[ind*2], seg[ind*2+1]);
  }
}
int maxim(int l,int r){
  l += LEN;
  r += LEN;
  int ans = 0;
  while(l < r){
    if(l & 1)ans = max(ans,seg[l++]);
    if(r & 1)ans = max(ans,seg[--r]);
    l /= 2;
    r /= 2;
  }
  return ans;
}
int main(){
  int n,q;
  cin >> n >> q;
  string S;
  cin >> S;
  stack<int> st;
  map<int,int> mp;
  rep(i,n){
    if(S[i] == '(')st.push(i+1);
    else{
      int a = st.top();
      add(a,i+1);
      mp[a] = i+1;
      mp[i+1] = a;
      st.pop();
    }
  }
  auto solve = [&](int x,int y){
    if(maxim(0,x+1) < y)return -1;
    int high = x + 1;
    int low = 0;
    int mid = (high + low)/2;
    while(high - low > 1){
      mid = (high + low)/2;
      //cout << high << " " << low << " "<<mid << " " << maxim(mid,x+1) << endl;
      if(maxim(mid,x+1) >= y)low = mid;
      else high = mid;
    }
    return low;
  };
  vector<int> ans;
  rep(i,q){
    int x,y;
    cin >> x >> y;
    int x_ = mp[x],y_=mp[y];
    if(x > x_)swap(x,x_);
    if(y > y_)swap(y,y_);
    x = min(x,y);
    x_ = max(x_,y_);
    //cout << "solve" << x << " " << x_ << endl;
    ans.push_back(solve(x,x_));
  }
  for(int p:ans){
    if(p == -1)cout << -1 << endl;
    else cout << p << " " << mp[p] << endl;
  }
  return 0;
}