#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <algorithm>
const int mod=1e9+7;
using LL=long long;
using std::cout;using std::endl;using std::cin;
using std::vector;using std::string;using std::set;using std::multiset;
using std::pair;using std::map;
using std::min;using std::max;
using std::make_pair;using std::swap;
std::ostream& operator<<(std::ostream& os,std::map<int,int>& obj){for(std::map<int,int>::iterator itr=obj.begin();itr!=obj.end();itr++){os<<itr->first<<"^"<<itr->second<<" ";}return os;}
std::ostream& operator<<(std::ostream& os,std::vector<std::map<int,int>>& obj){for(auto itr=obj.begin();itr!=obj.end();itr++){os<<*itr<<std::endl;}return os;}
std::ostream& operator<<(std::ostream& os,std::vector<int>& obj){for(auto itr=obj.begin();itr!=obj.end();itr++){os<<*itr<<" ";}return os;}
std::ostream& operator<<(std::ostream& os,std::vector<std::vector<int>>& obj){for(auto itr=obj.begin();itr!=obj.end();itr++){os<<*itr<<std::endl;}return os;}

namespace ndifix{
template<class T> void sort(T &v){std::sort(v.begin(),v.end());}
template<class T> void rsort(T &v){std::sort(v.rbegin(),v.rend());}

}


int main(){
  int n, k;cin>>n>>k;
  string s;cin>>s;
  vector<pair<int,int>> list;
  int buf=0;
  for(int i=0;i<n;i++){
    if(s[i]=='('){
      list.push_back(make_pair(i,0));
    }
    else if(s[i]==')' && s[i-1]=='('){
      list[list.size()-1].second=i;
      buf=list.size()-1;
    }
    else if(s[i]==')' && s[i-1]==')'){
      for(int j=buf-1;j>=0;j--){
        buf--;
        if(list[buf].second==0)break;
      }
      list[buf].second=i;
    }
    
  }
  for(int i=0;i<list.size();i++)if(list[i].first+1==k)cout<<list[i].second+1<<endl;
  for(int i=0;i<list.size();i++)if(list[i].second+1==k)cout<<list[i].first+1<<endl;

  //for(int i=0;i<list.size();i++)cout<<list[i].first<<" "<<list[i].second<<endl;
  return 0;
}