#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <stack>
#include <functional>
#include <queue>
#include <cmath>
#include <set>

#define rep(i,j,k) for(int i=j;i<k;i++)
#define Sort(x) sort((x).begin(),(x).end())
#define fi first
#define se second
#define vi vector<int>
#define INF 1000000000
#define MOD 1000000009
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef std::pair<int,int> pii;
int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};

using namespace std;


int main() {
    vector<int> v;
    int n,m;
    cin>>n>>m;
    string s;
    cin>>s;
    int x=1;
    rep(i,0,s.length()){
        if(i==0)v.pb(x);
        else {
            if(s[i]=='('){
                x++;
                v.pb(x);
            }else {
                v.pb(x);
                x--;
            }
        }
    }
    
    rep(i,0,v.size()){
        if(v[m-1]==v[i] && m-1!=i){
            cout<<i+1<<endl;
        }
    }
    
    return 0;
}