#include<iostream>
#include<cstring>
#include<vector>
#include<cmath>
#include<queue> 
#define ll long long
using namespace std;
int n,q,s,t;
ll a[200010];
ll c[200010];
int main(){
    freopen("foehn.in","r",stdin);
    freopen("foehn.out","w",stdout);
    
    scanf("%d%d%d%d",&n,&q,&s,&t);
    for(int i=0;i<=n;i++){
    	scanf("%lld",&a[i]);
		if(i>=1) c[i]=a[i]-a[i-1];
	}
    
    while(q--){
    	int li,ri;ll xi;scanf("%d%d%lld",&li,&ri,&xi);
    	c[li]+=xi;
    	c[ri+1]-=xi;
    	
		ll p=0;
		for(int i=1;i<=n;i++){
			if(c[i]>0) p-=c[i]*s;
			else p-=c[i]*t;
			cout<<c[i]<<" ";
		}
		cout<<endl;
		printf("%lld\n",p);
	}
    
    return 0;
}