#include <bits/stdc++.h>
using namespace std;
//#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define ll long long
ll mod=1000000007;
int inf=1000000007;
ll infl=1000000000000000007;
const int N=50007,K=24;
int g[K][K][N];
ll mx[K][K][N];
ll sum[K][K][N];
vector<int>S,P,W,L;
int n;
void init(int nn,vector<int>s,vector<int>p,vector<int>w,vector<int>l)
{
n=nn;
s.pb(0);
p.pb(0);
w.pb(n);
l.pb(n);
S=s,P=p,W=w;L=l;
for(int j=0;j<K;j++)
{
for(int i=0;i<=n;i++)
{
if(s[i]<(1<<j))
{
g[0][i][j]=w[i];
sum[0][i][j]=s[i];
mx[0][i][j]=-infl;
}
else
{
g[0][i][j]=l[i];
sum[0][i][j]=p[i];
mx[0][i][j]=-s[i];
}
}
for(int l=1;l<K;l++)
{
for(int i=0;i<=n;i++)
{
int x=g[l-1][i][j];
g[l][i][j]=g[l-1][x][j];
sum[l][i][j]=sum[l-1][i][j]+sum[l-1][x][j];
mx[l][i][j]=max(mx[l-1][i][j],sum[l-1][i][j]+mx[l-1][x][j]);
}
}
}
}
ll simulate(int x,int z)
{
ll a=z;
int j=0;
while(x!=n)
{
while(j<23&&a>=(1LL<<(j+1))) j++;
for(int l=K-1;l>=0;l--)
{
if(g[l][x][j]==n||a+mx[l][x][j]>=0) continue;
a+=sum[l][x][j];
x=g[l][x][j];
}
if(a>=S[x])
{
a+=S[x];
x=W[x];
}
else
{
a+=P[x];
x=L[x];
}
while(j<23&&a>=(1LL<<(j+1))) j++;
}
return a;
}
/*int main()
{
freopen("in.txt","r",stdin);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n,q;
cin>>n>>q;
vector<int>sa(n),pa(n),wa(n),la(n);
for(int i=0;i<n;i++) cin>>sa[i];
for(int i=0;i<n;i++) cin>>pa[i];
for(int i=0;i<n;i++) cin>>wa[i];
for(int i=0;i<n;i++) cin>>la[i];
init(n,sa,pa,wa,la);
cout<<"XD"<<endl;
while(q--)
{
int a,b;
cin>>a>>b;
cout<<simulate(a,b)<<endl;
}
return 0;
}*/
