#include "closing.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
int n, x, y, ch[202020], ans;
ll k, need[202020], d[202020], dsum[202020];
vector<pll> adj[202020];
int out(int a, int b, int remain) {
vector<int> outside;
int ret = 0;
for (int i = x; i >= 0; i--) outside.push_back(max(0LL, dsum[x] - dsum[i] - need[i]));
for (int i = y; i < n; i++) outside.push_back(max(0LL, dsum[i] - dsum[y] - need[i]));
sort(outside.begin(), outside.end());
for (int i = 0; i < outside.size(); i++) {
if (remain >= outside[i]) {
ret++;
remain -= outside[i];
}
else break;
}
return ret;
}
int max_score(int N, int X, int Y, ll K, vector<int> U, vector<int> V, vector<int> W) {
n = N, x = X, y = Y, k = K;
ans = 0;
for (int i = 0; i < n; i++) adj[i].clear();
for (int i = 0; i < (int)U.size(); i++) {
adj[U[i]].push_back({V[i], W[i]});
adj[V[i]].push_back({U[i], W[i]});
d[max(U[i], V[i])] = W[i];
}
for (int i = 1; i < n; i++) dsum[i] = dsum[i - 1] + d[i];
for (int a = 0; a < n - x; a++) {
ll sum = 0;
for (int i = 0; i < n; i++) need[i] = 0;
for (int i = x + 1; i <= a + x; i++) need[i] = dsum[i] - dsum[x];
for (int i = x + 1; i <= a + x; i++) sum += need[i];
for (int b = 0; b <= y; b++) {
if (need[y - b] < dsum[y] - dsum[y - b]) {
sum += dsum[y] - dsum[y - b] - need[y - b];
need[y - b] = dsum[y] - dsum[y - b];
}
if (sum <= k) ans = max(ans, a + b + out(a, b, k - sum));
else break;
//cout << a << " " << b << "\n";
}
}
return ans;
}
