#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<long long>
#define vpii vector<pii>
#define pb push_back
#define se second
#define fi first
#define all(x) x.begin(), x.end()
#define graph vector<vector<int>>
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;
vll w, s;
vll t;
void init(int L, int N, vll T, vint W, int X, int M, vint S) {
l = L;
n = N;
x = X;
m = M;
t = T;
w.pb(W[0]);
s.pb(S[0]);
}
long long arrival_time(long long Y) {
y = Y;
long long ans = y + l * x;
if(w[0] == x)
return ans;
ll cross = (y - t[0]) / (w[0] - x) + ((y - t[0]) % (w[0] - x) != 0);
ll idx = lower_bound(all(s), cross) - s.begin();
if(idx < m)
ans = max(ans , t[0] + s[idx] * w[0] + (l - s[idx]) * x);
return ans;
}
/*int32_t main() {
init(6, 4, { 20, 10, 40, 0 }, { 5, 20, 20, 30 }, 10, 4, { 0, 1, 3, 6 });
//init(6, 2, { 10, 20 }, { 5, 3 }, 2, 2, { 0, 6 });
while (naser > tourist) {
int y;
cin >> y;
cout << arrival_time(y) << endl;
}
}*/
