#include "dungeons.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "Ofast")
#define ll long long
#define se second
#define fi first
#define pb push_back
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii,pii> ipii;
const int MAXN = 1e6+10;
const int MAXA = 5e4+10;
const int SQRT = 300;
const ll INF = 1e9;
const int MOD = 998244353;
const int LOG = 20;
ll n, s[MAXN], p[MAXN], w[MAXN], l[MAXN];
void init(int N, std::vector<int> S, std::vector<int> P, std::vector<int> W, std::vector<int> L) {
n = N;
for(int i=1; i<=n; i++){
s[i] = S[i-1], p[i] = P[i-1], w[i] = W[i-1]+1, l[i] = L[i-1]+1;
}
return;
}
long long simulate(int x, int z) {
ll idx = x+1, pow = z;
while(idx != n+1){
if(pow >= s[idx]){
pow += s[idx]; idx = w[idx];
} else {
pow += p[idx]; idx = l[idx];
}
}
return pow;
}
