#include <bits/stdc++.h>
//#define int long long
#define ll long long
#define endl '\n'
#define pii pair<int,int>
#define vint vector<int>
#define vll vector<ll>
#define vpii vector<pii>
#define pb push_back
#define se second
#define fi first
#define all(x) x.begin(), x.end()
#define graph vector<vll>
using namespace std;
const int N = (int)2e5 + 69;
const int mod = (int)1e4 + 7;
const int naser = 3999, tourist = 3816;
int power(int a, int b) { int ans = 1; while (b) { if (b % 2) ans *= a; a *= a; b /= 2; } return ans; }
ll n, x, m, l, y, stn;
vll w, s, t;
graph arv, srt,arvsrt;
bool cmp(int a, int b) {
if (arv[stn][a] == arv[stn][b])
return w[a] < w[b];
return arv[stn][a] < arv[stn][b];
}
bool cmp2(int a, int b) {
return arv[stn][a] < b;
}
void init(int L, int N, vll T, vint W, int X, int M, vint S) {
n = N;
t = T;
w.resize(n);
for (int i = 0; i < n; i++)
w[i] = W[i];
x = X;
m = M;
s.resize(m);
for (int i = 0; i < m; i++)
s[i] = S[i];
arv.resize(m, vll(n));
srt.resize(m, vll(n));
arvsrt.resize(m);
vector<ll> tmp;
for (int i = 0; i < n; i++) {
arv[0][i] = t[i];
arvsrt[0].pb(t[i]);
tmp.pb(i);
}
sort(all(arvsrt[0]));
for (int i = 1; i < m; i++) {
stn = i-1;
sort(all(tmp), cmp);
for (int j = 0; j < n; j++)
srt[i][j] = tmp[j];
for (int j = 0; j < n; j++) {
int bus = srt[i][j];
int prv = (j ? srt[i][j - 1] : srt[i][j]);
arv[i][bus] = arv[i - 1][bus] + (s[i] - s[i - 1]) * w[bus];
if (arv[i - 1][prv] < arv[i - 1][bus])
arv[i][bus] = max(arv[i][bus], arv[i][prv]);
arvsrt[i].pb(arv[i][bus]);
}
sort(all(srt[i]));
sort(all(arvsrt[i]));
}
}
long long arrival_time(long long y) {
ll ans = y;
for (int i = 0; i < m - 1; i++) {
ll ex = ans + (s[i+1] - s[i]) * x;
if (ans <= arvsrt[i][0])
ans = ex;
else {
int idx = 0;
while (ans > arvsrt[i][idx] && idx < n)
idx++;
int prv = srt[i+1][idx - 1];
if (ex < arv[i+1][prv])
ans = arv[i+1][prv];
else
ans = ex;
}
}
return ans;
}
