#include "candies.h"
#include <bits/stdc++.h>
using namespace std;
template<typename T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using max_heap = priority_queue<T, vector<T>, less<T>>;
using int64 = long long;
using ld = long double;
constexpr int kInf = 1e9 + 10;
constexpr int64 kInf64 = 1e15 + 10;
constexpr int kMod = 1e9 + 7;
vector<int> distribute_candies(vector<int> C, vector<int> L, vector<int> R, vector<int> V) {
const int n = C.size();
const int q = L.size();
vector<int> box(n);
for (int query = 0; query < q; query++) {
for (int i = L[query]; i <= R[query]; i++) {
box[i] += V[query];
box[i] = max(box[i], 0);
box[i] = min(box[i], C[i]);
}
}
return box;
}
