#include "dungeons.h"
#include <bits/stdc++.h>
#define int long long
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
int N;
vector<int> s,p,w,l;
void init(signed n, std::vector<signed> S, std::vector<signed> P, std::vector<signed> W, std::vector<signed> L) {
N=n;
s.resize(N);
p.resize(N);
w.resize(N);
l.resize(N);
for (int i = 0; i < n; i++)
{
s[i]=S[i];
p[i]=P[i];
w[i]=W[i];
l[i]=L[i];
}
return;
}
long long simulate(signed x, signed z) {
int u=x;
int cs=z;
while(u!=N) {
if(cs>=s[u]){
cs+=s[u];
u=w[u];
}else{
cs+=p[u];
u=l[u];
}
}
return cs;
}
