#include <bits/stdc++.h>
using namespace std;
int main()
{long long n,m;cin>>n>>m;long long op[105],x[105];for(int i=1;i<=n;i++) cin>>op[i]>>x[i];for(int i=n;i>=1;i--){if(op[i]==1) m-=x[i];else if(op[i]==2)m+=x[i];else if(op[i]==3) {if(x[i]==0) m=0;else m=m/x[i];}else m=m*x[i];}cout<<m<<endl;return 0;
}

#include <bits/stdc++.h>
using namespace std;
int main()
{int n,m;long long ans=0;int a=0,b=0,c=0;cin>>n;for(int i=0;i<n;i++){cin>>m;if(m==0) a++;if(m==2) b++;if(m==4) c++;}int t=0;for(int i=0;i<n;i++){if(t==0){if(c>0) c--,ans+=16,t=4;else if(b>0) b--,ans+=4,t=2;else a--;}else if(t==2){if(c>0) c--,ans+=4,t=4;else if(a>0) a--,ans+=4,t=0;else b--;}else if(t==4){if(a>0) a--,ans+=16,t=0;else if(b>0) b--,ans+=4,t=2;else c--;}}cout<<ans<<endl;return 0;
}

#include <bits/stdc++.h>
using namespace std;
int n;
struct node{int a,b;
}num[3005];int cmp(node x,node y){if(x.b==y.b) return x.a<y.b;return x.b>y.b;}
int main()
{std::ios::sync_with_stdio(false);cin>>n;for(int i=0;i<n;i++){cin>>num[i].b;num[i].a=i;}sort(num,num+n,cmp);int s,t;//for(int i=0;i<n;i++) cout<<num[i].a<<' '<<num[i].b<<endl;for(int i=0;i<n;i++){if(num[i].a==0) s=i;if(num[i].a==n-1) t=i;}//cout<<s<<' '<<t<<endl;if(s>t) cout<<-1<<endl;else{int dp[3005];memset(dp,0,sizeof(dp));dp[s]=num[s].b;for(int i=s+1;i<=t;i++){for(int j=s;j<i;j++){dp[i]=max(dp[i],dp[j]^num[i].b);}}if(!dp[t]) cout<<-1<<endl;else cout<<dp[t]<<endl;}return 0;
}

#include<bits/stdc++.h>
#define LL long long
using namespace std;
const int MAXN = 10003, INF = 1e9 + 10;
void chmin(int &a, int b) {a = (a < b ? a : b);}
void chmax(int &a, int b) {a = (a > b ? a : b);}
int sqr(int x) {return x * x;}
inline int read() {char c = getchar(); int x = 0, f = 1;while(c < '0' || c > '9') {if(c == '-') f = -1; c = getchar();}while(c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();return x * f;
}
int N, mx;
bool f[MAXN][MAXN];
struct Node {int id, val;bool operator < (const Node &rhs) const {return val > rhs.val;}
}a[MAXN];
signed main() {//freopen("a2.in", "r", stdin);//cout << (457 ^ 23);N = read();for(int i = 1; i <= N; i++) a[i].id = i, a[i].val = read(); mx = 6001;sort(a + 1, a + N + 1);for(int i = 1, flag = 1; i <= N; i++) {if(a[i].id == 1) {flag = 0, f[i][a[i].val] = 1; continue;}if(flag) continue;if(a[i].id == N) {int k = i - 1;while(k && a[i].val == a[k].val) k--;if(!k) break;for(int j = mx; j >= 0; j--) {f[i][j] |= f[k][j ^ a[i].val];if(f[i][j]) {printf("%d", j); return 0;}} break;}else if(a[i].val == a[i - 1].val) {memcpy(f[i], f[i - 1], sizeof(f[i]));}else {for(int j = 0; j <= mx; j++) f[i][j] |= (f[i - 1][j ^ a[i].val] | f[i - 1][j]);     }}puts("-1");return 0;
}