题解 | #【模板】差分#

import java.io.*;
import java.util.*;
import java.math.BigInteger;

public class Main {
    static int N = (int)(1e5+10);
    static long[] a = new long[N], d = new long[N];

    static void solve() {
        int n = in.nextInt(), m = in.nextInt();
        for(int i=1;i<=n;i++) {
            a[i] = in.nextLong();
            d[i] = a[i] - a[i-1];
        }
        while(m-->0) {
            int l = in.nextInt(), r = in.nextInt(), k = in.nextInt();
            d[l] += k;
            d[r+1] -= k;
        }
        for(int i=1;i<=n;i++) {
            d[i]+=d[i-1];
            out.print(d[i]+" ");
        }
    }

    public static void main(String[] args) {
        solve();
        out.flush();
    }

    static FastReader in = new FastReader();
    static PrintWriter out = new PrintWriter(System.out);

    static class FastReader {
        static BufferedReader br;
        static StringTokenizer st;

        FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            String str = "";
            while (st == null || !st.hasMoreElements()) {
                try {
                    str = br.readLine();
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
                st = new StringTokenizer(str);
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }
    }
}