#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
#define int ll
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(signed l, signed n, std::vector<long long> t, std::vector<signed> w, signed x, signed m, std::vector<signed> s)
{
L = l, N = n, T = t;
W = vl(all(w)), X = x, M = m, S = vl(all(s));
W.pb(X);
return;
}
long long arrival_time(long long Y) {
vl A = T;
A.pb(Y);
map<ll, vi> idx;
f0r(i, N) /*if (A[i] < A[N])*/ idx[A[i]].pb(i);
idx[Y].pb(N);
ll mx = 0;
fnr(i, 1, M) {
map<ll, vi> idx2;
mx = 0;
for (auto &[t, v]: idx) {
ll mx2 = mx;
forl(j, v) {
ll m = max(mx, t + (S[i] - S[i-1]) * W[j]);
mx2 = max(mx2, m);
idx2[m].pb(j);
}
mx = mx2;
}
//idx2[mx] = {N};
idx.swap(idx2);
}
return mx;
}
