#include "dungeons.h"
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize("-Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef int in;
#define int long long
#define double long double
#define f first
#define s second
#define pb push_back
#define pp push
#define ceil(x,y) (x/y)+(x%y!=0)*(x*y<0?0:1)
#define floor(x,y) (x/y)+(x%y!=0)*(x*y<0?-1:0)
const int MAAX=1e18;
const int MOD=1e9+7;
const int MAX=1e9;


int n,last[400010],fin[400010],vis[400010],tk[400010];
vector<in> s,p,w,l;
void init(in N, vector<in> S, vector<in> P, vector<in> W, vector<in> L) {
	n=N,s=S,p=P,w=W,l=L;
	for(int i=0;i<n;i++){
		if(!last[i]){
			int x=i,z=0;
			vector<int> v;
			while(1){
				vis[x]=1;
				z+=p[x];
				x=l[x];
				v.pb(x);
				if(x==i)
					break;
				else if(vis[x])
					goto a;
			}
			for(int j=0;j<v.size();j++)
				last[v[j]]=z;
			a:;
		}
		if(!fin[i]){
			int x=i,z=0;
			vector<int> v;
			v.pb(x);
			while(x<n){
				tk[x]=z;
				z+=s[x];
				x=w[x];
				if(x<n)
					v.pb(x);
			}
			for(int j=0;j<v.size();j++){
				fin[v[j]]=z-tk[v[j]];
			}
		}
	}
	return;
}

int simulate(in x, in z) {
	while(x<n){
		if(z>=s[x]){
			z+=fin[x];
			break;
		}
		else if(z+last[x]<=s[x]&&last[x]){
			int y=last[x];
			int a=(s[x]-z)/y;
			z+=a*y;
		}
		else{
			z+=p[x];
			x=l[x];
		}
	}
	return z;
}