#include <algorithm>
#include <fstream>
#include <vector>
#include <queue>
#include <stack>
#include <iostream>
#include <cmath>
#include <queue>
#include <set>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <unordered_set>
#define F first
#define S second
#define PB push_back
using namespace std;
const long long MOD=1e9+7, INF=1e18;
const int INFI=1e9;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<pair<int, ii>> viii;
typedef vector<vii> vvii;
typedef vector<ll> vll;
typedef vector<vll> vvll;
vll t;
vi w, s;
int l, n, x, m;
void init(int L, int N, vll T, vi W, int X, int M, vi SS)
//int main()
{
l=L; n=N; x=X; m=M;
t=T; w=W; s=SS;
}
ll arrival_time(ll y){
if(n!=1) return 0;
ll ex1=t[0], ex2=y, t1=t[0], t2=y;
for(int i=1;i<m;i++){
ll aux1=t1, aux2=t2;
ex1=t1+(w[0]*((ll)s[i]-s[i-1]));
ex2=t2+(y*((ll)s[i]-s[i-1]));
if(aux2<aux1){
t1=max(ex1, ex2);
t2=ex2;
}
else if(aux1==aux2){
t1=ex1;
t2=ex2;
}
else{
t2=max(ex1, ex2);
t1=ex2;
}
}
return t2;
}
