#include <bits/stdc++.h>

#define ll long long
using namespace std;

ll X, N, M, L, Y;
vector<int> cars;
vector<ll> T;
vector<int> W;
vector<int> S;

void init(int l, int n, vector<ll> t, vector<int> w, int x, int m, vector<int> s) {
    L = l; N = n; M = m; X = x;
	cars.resize(N);
    for (int i = 0; i < N; i++){
        cars[i] = i;
	}
    T = t;
	W=w;
	S=s;
}

int search(ll l, ll r) {
    if (l == r) {
        if (T[0] + W[0] * S[l] >= Y + X * S[l]){
            return l;
        }
        return -1;
    }

    ll mid = l + (r-l)/ 2;
    if (Y + X * S[mid] <= T[0] + W[0] * S[mid]) {
        return search(l, mid);
	}
    return search(mid + 1, r);
}

ll arrival_time(ll k) {
    Y = k;
    if (W[0] <= X || T[0] >= Y)
        return Y + X * L;

    int idx = search(1, M - 1);

    if (idx == -1) {
        return Y + X * L;
    }

    return T[0] + W[0] * S[idx] + (L - S[idx]) * X;
}