#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define f0r(i, n) for (auto i = 0; i < (n); ++i)
#define fnr(i, n, k) for (auto i = (n); i < (k); ++i)
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define F first
#define S second
#define ctn(x) cout << x << '\n'
#define forl(a, l) for (auto a : l)
#define ctl(l) for (auto &a : (l)) cout << a << ' '; cout << endl;
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define ub(v, x) (upper_bound(all(v), x) - begin(v))
#define pq priority_queue
template <class T>
using V = vector<T>;
using ll = long long;
using vi = V<int>;
using vl = V<ll>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using ti = tuple<int, int, int>;
using Adj = V<vi>;
using vvi = V<vi>;
#include "overtaking.h"
int L, N, X, M;
vl T;
vi W, S;
void init(int l, int n, std::vector<long long> t, std::vector<int> w, int x, int m, std::vector<int> s)
{
L = l, N = n, T = t;
W = w, X = x, M = m, S = s;
W.pb(X);
return;
}
long long arrival_time(long long Y) {
vl A = T;
A.pb(Y);
set<pl> idx;
idx.insert( {Y, N} );
f0r(i, N) if (A[i] < A[N]) idx.insert( {A[i], i} );
ll mx = 0;
fnr(i, 1, M) {
V<pl> idx2;
mx = 0;
for (auto &[t, j]: idx) {
mx = max(mx, t + (S[i] - S[i-1]) * W[j]);
idx2.pb({mx, j});
}
idx.clear();
idx.insert( {mx, N} );
for (auto &[t, j]: idx2) if (t < mx)
idx.insert( {t, j} );
}
return mx;
}
