#include <fstream>
#include <cmath>
#include <algorithm>

using namespace std;

ifstream fin("culori.in");
ofstream fout("culori.out");


int main(){
    int c, l, n, m;
    int v[10005];
    int b[10005];

    fin >> c >> l >> n >> m;
    for (int i = 1; i <= n; ++i)
        fin >> v[i];



    if (c == 1){
        int nr = 1, max = 0;
        for (int i = 1; i < n; ++i){
        	if (v[i] == v[i + 1])
                nr++;
            else {
             	if (max < nr)
                    max = nr;
                nr = 1;
            }
        }
        fout << max;
    }
    else {
        b[1] = v[1];
        for (int i = 2; i <= n; ++i)
            b[i] = v[i] - v[i - 1];
        b[n + 1] = 0;

        int A, B, X;
        for (int i = 0; i < m; ++i){
            fin >> A >> B >> X;
        b[A] += X;
        b[B + 1] -= X;
        }

        v[1] = b[1];
        for (int i = 2; i <= n; ++i){
            v[i] = v[i - 1] + b[i];
        }
        for (int i = 1; i <= n; ++i)
            fout << v[i] << " ";
        }

    return 0;
}