#include <bits/stdc++.h>
using namespace std;
#define int long long
using ll = long long;
#define FOR(I, L, R) for(int I(L) ; I <= (int)R ; ++I)
#define FOD(I, R, L) for(int I(R) ; I >= (int)L ; --I)
#define FOA(I, A) for(auto &I : A)
#define print(A,L,R) FOR(OK, L, R){if(A[OK]<=-oo / 10||A[OK]>=oo)cout<<"- ";else cout<<A[OK]<<' ';}cout<<'\n';
#define prints(A) FOA(OK, A){cout<<OK<<' ';}cout << '\n';
#define printz(A,L,R) FOR(OK, 0, L){FOR(KO, 0, R){if(A[OK][KO]>-oo&&A[OK][KO]<oo)cout<<A[OK][KO]<<' ';else cout << "- ";} cout << '\n';}cout << '\n';
#define fs first
#define sd second
#define ii pair<int,int>
#define iii pair<int, ii>
#define all(A) A.begin(), A.end()
#define quickly ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
const int oo = 1e18;
int n, q, s, t;
int a[N];
int add(int x, int y){
if(x < y){
return (x - y) * s;
}
else{
return (x - y) * t;
}
}
struct node{
int sum, lazy, left, right;
node(){lazy = 0; sum = left = right = oo;}
node operator + (const node &t) const{
node _new;
if(sum == oo && t.sum == oo) return node();
if(sum == oo) return t;
if(t.sum == oo) return *this;
_new.left = left;
_new.right = t.right;
_new.sum = sum + t.sum + add(right, t.left);
return _new;
}
};
struct Segment_tree{
node sg[N << 2];
void build(int id, int l, int r){
if(l == r){
sg[id].sum = 0;
sg[id].left = sg[id].right = a[l];
return;
}
int mid = (l + r) >> 1;
build(id << 1, l, mid);
build(id << 1 | 1, mid + 1, r);
sg[id] = sg[id << 1] + sg[id << 1 | 1];
}
void push_down(int id, int l, int r){
if(sg[id].lazy){
int &val = sg[id].lazy;
sg[id << 1].lazy += val;
sg[id << 1 | 1].lazy += val;
sg[id << 1].left += val;
sg[id << 1 | 1].left += val;
sg[id << 1].right += val;
sg[id << 1 | 1].right += val;
val = 0;
}
}
void update(int id, int l, int r, int u, int v, int val){
if(l > v || r < u){
return;
}
if(u <= l && r <= v){
sg[id].lazy += val;
sg[id].left += val;
sg[id].right += val;
return;
}
push_down(id, l, r);
int mid = (l + r) >> 1;
update(id << 1, l, mid, u, v, val);
update(id << 1 | 1, mid + 1, r, u, v, val);
sg[id] = sg[id << 1] + sg[id << 1 | 1];
}
node get(int id, int l, int r, int u, int v){
if(l > v || r < u){
return node();
}
if(u <= l && r <= v){
return sg[id];
}
push_down(id, l, r);
int mid = (l + r) >> 1;
return get(id << 1, l, mid, u, v) + get(id << 1 | 1, mid + 1, r, u, v);
}
} sg;
signed main(){ quickly
cin >> n >> q >> s >> t;
FOR(i, 0, n){
cin >> a[i];
}
sg.build(1, 0, n);
while(q--){
int l, r, w;
cin >> l >> r >> w;
sg.update(1, 0, n, l, r, w);
cout << sg.sg[1].sum << '\n';
}
}
