#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#include<atcoder/modint>
using namespace atcoder;
using mint = modint998244353;

vector<string> S;
ll calc(ll x){
    int N=S.size();
    stack<ll> P;
    for(int i=0;i<N;i++){
        if(S[i]=="X")P.push(x);
        else if(S[i]=="+"){
            ll y=P.top();
            P.pop();
            ll z=P.top();
            P.pop();
            P.push(y+z);
        }
        else if(S[i]=="max"){
            ll y=P.top();
            P.pop();
            ll z=P.top();
            P.pop();
            P.push(max(y,z));
        }
        else if(S[i]=="min"){
            ll y=P.top();
            P.pop();
            ll z=P.top();
            P.pop();
            P.push(min(y,z));
        }
        else P.push(stoll(S[i]));
    }
    return P.top();
}

void solve() {
    ll Q,Y;
    cin>>Q>>Y;
    S.resize(Q);
    for(int i=0;i<Q;i++)cin>>S[i];
    ll L=-1,R=Y+1;
    while(R-L>1){
        ll M=(R+L)/2;
        if(calc(M)>=Y)R=M;
        else L=M;
    }
    if(calc(R)==Y)cout<<R<<endl;
    else cout<<-1<<endl;
}

int main() {

    ios::sync_with_stdio(false);
    cin.tie(nullptr);


    // ll T;
    // cin>>T;
    // while(T--)
    solve();
}