#pragma GCC optimize("Ofast")

#include <bits/stdc++.h>

#define _debugVar(x) { cerr << "* "#x" = " << x << endl; }
#define _debugHere { fprintf(stderr, "* Passing [%s] in Line %d\n", __FUNCTION__, __LINE__); }

using namespace std;
using LL = long long;
using PII = pair<int, int>;

const int N = 1e6+5;

int n;
LL m;
char str[N];
LL cnta[N], cntq[N], sum[N];
LL f[N];

double slope(int i, int j)
{
	static const auto X = [&](int j) -> double {
		return (double)cnta[j];
	};
	static const auto Y = [&](int j) -> double {
		return (double)cnta[j]*cntq[j]-sum[j]+f[j];
	};

	// fprintf(stderr, "* X(%d) = %.6lf\n", i, X(i));
	// fprintf(stderr, "* Y(%d) = %.6lf\n", i, Y(i));
	// fprintf(stderr, "* X(%d) = %.6lf\n", j, X(j));
	// fprintf(stderr, "* Y(%d) = %.6lf\n", j, Y(j));
	double res = (Y(j)-Y(i))/(X(j)-X(i));
	// fprintf(stderr, "slope(%d, %d) = %.6lf\n", i, j, res);
	return res;
}

int main()
{
	// freopen("1.in", "r", stdin);
	scanf("%d%lld", &n, &m);
	scanf(" %s", str+1);

	for(int i = 1; i <= n; i++) {
		cnta[i] = cnta[i-1]+(str[i] == '+');
		cntq[i] = cntq[i-1]+(str[i] == '?');
		sum[i] = sum[i-1]+(str[i] == '?')*cnta[i];
	}

	static int q[N];
	int hh = 1, tt = 0;
	f[0] = -m;
	q[++tt] = 0;

	for(int i = 1; i <= n; i++) {
		//_debugVar(slope(q[hh], q[hh+1]));
		// int j = hh;
		// while(j < tt && slope(q[j], q[j+1]) >= cntq[i]) j++;
		// while(hh < tt && slope(q[tt-1], q[tt]) <= cntq[i]) tt--;
		while(hh < tt && slope(q[hh], q[hh+1]) <= cntq[i]) hh++;
		int j = q[hh];
		f[i] = f[j]+(sum[i]-sum[j])-(cntq[i]-cntq[j])*cnta[j]+m;
		// fprintf(stderr, "f[%d] = %lld from %d\n", i, f[i], j);
		if(str[i] == '+') {
			while(hh < tt && slope(q[tt-1], q[tt]) >= slope(q[tt-1], i)) tt--;
			q[++tt] = i;
		}
	}

	// for(int i = 1; i <= n; i++) {
	// 	for(int j = 0; j <= i-1; j++) {
	// 		f[i] = min(f[i], f[j]+(sum[i]-sum[j])-(cntq[i]-cntq[j])*cnta[j]+m);
	// 	}
	// }
	printf("%lld\n", f[n]);
	return 0;
}