#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
//#include<set>
//#include<queue>
//#include<stack>
#define PII pair<int,int>
#define MP make_pair
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
inline LL read()
{
	LL s=0; bool w=0; char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-') w=1; ch=getchar();}
	while(ch>='0'&&ch<='9'){s=(s<<3)+(s<<1)+(ch^48); ch=getchar();}
	return w ? ~s+1 : s;
}

const int maxn = 100005;
const int inf = 2147483624;
const LL infl = 9223372036854775807;

int n,m;
char str[maxn];
int a[maxn]; //前缀和

struct Node
{
	int l,r;
	vector<int> son;
	vector<int> typ;
}tr[maxn*20];
int tot;

void MakeNode(int l,int r,int fa,int x,int t)
{
	tr[x].l = l; tr[x].r = r; tr[fa].son.emplace_back(x); tr[fa].typ.emplace_back(t);
}

void Build(int l,int r,int x)
{
	if(l>=r) return;
	int minn = inf,lst = l;
	for(int i=l; i<=r; i++) minn = min(minn,a[i]);
	tr[x].son.emplace_back(0); tr[x].typ.emplace_back(0);
	for(int i=l; i<=r; i++)
	{
		if(a[i] == minn)
		{
			if(lst <= i-1)
			{
				MakeNode(lst,i-1,x,++tot,0);
				Build(lst,i-1,tot);
			}
			MakeNode(i,i,x,++tot,1);
			lst = i+1;
		}
		else if(i==r) //以防最后一个不是最小值
		{
			MakeNode(lst,i,x,++tot,0);
			Build(lst,i,tot);
		}
	}
	return;
}

struct DP1
{
	LL val; //子串的数目
	int num; //切了多少刀
	DP1(){}; DP1(LL val_,int num_) {val = val_; num = num_;}
}f[maxn],g[maxn]; //在每个节点处用于计算当前节点的f
LL h[maxn]; //每个节点不被切时的贡献
LL pre[maxn],sum[maxn];

struct DP2
{
	LL x,y;
	int num;
	DP2(){}; DP2(LL x_,LL y_,LL n_){x=x_; y=y_; num=n_;}
}que[maxn<<2];
int hd,tl;
LL tng; //切线的斜率

double Slope(DP2 x,DP2 y) { return y.x == x.x ? inf : (1.0*(y.y - x.y)/(y.x - x.x)); }

void Push(DP2 d)
{
	while(tl>hd && Slope(que[tl],d) < Slope(que[tl-1],que[tl])) {tl--;}
	que[++tl] = d; return;
}

void Pop() { while(tl>hd && Slope(que[hd],que[hd+1]) < tng) hd++; }

void DP(int u,LL K) //K是每一个段需要减去的额外价值
{
	if(tr[u].l > tr[u].r) {f[u].val = f[u].num = 0; return; } //空区间根本没法下刀
	if(tr[u].l == tr[u].r) {f[u].val = -K; f[u].num = 1; return;} //如果只有一个，只能切一刀
	int sz = tr[u].son.size()-1;
	for(int i=1; i<=sz; i++) { DP(tr[u].son[i],K); }
	for(int i=1; i<=sz; i++)
	{
		sum[i] = sum[i-1] + h[tr[u].son[i]];
		pre[i] = pre[i-1] + tr[u].typ[i];
	}
	hd = 1; tl = 0;
	Push(DP2(0,0,0));
	for(int i=1; i<=sz; i++)
	{
		tng = pre[i]; Pop();
		g[i].val = que[hd].y - que[hd].x * tng
		         + f[tr[u].son[i]].val + sum[i-1] + ((pre[i]-1)*pre[i])/2;
		g[i].num = que[hd].num + f[tr[u].son[i]].num;
		Push(DP2(pre[i-1],g[i].val - sum[i] + ((pre[i-1]+1)*pre[i-1])/2,g[i].num));
	}
	LL tmp = 0;
	LL minn = infl,res = 0;
	for(int i=sz; i>=1; i--) //这里是不是可以改成0，来避免后面的特判
	{
		g[i].val += tmp + ((pre[sz] - pre[i-1])-1)*(pre[sz] - pre[i-1])/2;
		tmp += h[tr[u].son[i]];
		if(g[i].val<minn || (g[i].val == minn && g[i].num>g[res].val))
			{ minn = g[i].val; res = i; }
	}
	h[u] = sum[sz] + ((pre[sz]-1)*pre[sz])/2;
	f[u].val = g[res].val; f[u].num = g[res].num;
	return;
}

int main()
{
	//freopen("input.txt","r",stdin);
	//freopen("output.txt","w",stdout);
	n = read(); m = read();
	scanf("%s",str+1);
	a[1] = 0;
	for(int i=1; i<=n; i++) a[i+1] = a[i] + (str[i] == '(' ? 1 : -1);
	n++;
	tr[1].l = 1; tr[1].r = n;
	Build(1,n,++tot);
	int l = -n*n,r = 1,mid;
	LL minans = infl;
	while(l<r)
	{
		mid = (l+r)>>1;
		DP(1,mid);
		if(f[1].val > h[1]) {f[1].val = h[1]; f[1].num = 0;}
		if(f[1].num+1 >= m) {minans = min(minans,f[1].val); r = mid;}
		else l = mid+1;
	}
	printf("%lld\n",minans + (m-1)*l);
	//fclose(stdin);
	return 0;
}