import java.io.*;
import java.util.*;
import java.util.stream.*;

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        int q = sc.nextInt();
        PriorityQueue<Query> queue = new PriorityQueue<>();
        BinaryIndexedTree counts = new BinaryIndexedTree(n + 1);
        for (int i = 1; i <= n; i++) {
            queue.add(new Query(i, sc.nextInt()));
            counts.add(i, 1);
        }
        for (int i = 0; i < q; i++) {
            queue.add(new Query(i, sc.nextInt(), sc.nextInt(), sc.nextInt()));
        }
        BinaryIndexedTree bit = new BinaryIndexedTree(n + 1);
        long[] ans = new long[q];
        while (queue.size() > 0) {
            Query x = queue.poll();
            if (x.isQuery()) {
                ans[x.idx] = bit.getSum(x.left, x.right) + counts.getSum(x.left, x.right) * x.value;
            } else {
                bit.add(x.idx, x.value);
                counts.add(x.idx, -1);
            }
        }
        System.out.println(String.join("\n", Arrays.stream(ans).mapToObj(String::valueOf).toArray(String[]::new)));
    }
    
    static class Query implements Comparable<Query> {
        int idx;
        int left;
        int right;
        int value;
        
        public Query(int idx, int left, int right, int value) {
            this.idx = idx;
            this.left = left;
            this.right = right;
            this.value = value;
        }
        
        public Query(int idx, int value) {
            this(idx, 0, 0, value);
        }
        
        public boolean isQuery() {
            return left > 0;
        }
        
        public int compareTo(Query another) {
            return value - another.value;
        }
    }
}
class BinaryIndexedTree {
    int size;
    long[] tree;
    
    public BinaryIndexedTree(int size) {
        this.size = size;
        tree = new long[size];
    }
    
    public void add(int idx, long value) {
        int mask = 1;
        while (idx < size) {
            if ((idx & mask) != 0) {
                tree[idx] += value;
                idx += mask;
            }
            mask <<= 1;
        }
    }
    
    public long getSum(int from, int to) {
        return getSum(to) - getSum(from - 1);
    }
    
    public long getSum(int x) {
        int mask = 1;
        long ans = 0;
        while (x > 0) {
            if ((x & mask) != 0) {
                ans += tree[x];
                x -= mask;
            }
            mask <<= 1;
        }
        return ans;
    }
}
class Utilities {
    static String arrayToLineString(Object[] arr) {
        return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n"));
    }
    
    static String arrayToLineString(int[] arr) {
        return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new));
    }
}
class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    StringBuilder sb = new StringBuilder();
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public double nextDouble() throws Exception {
        return Double.parseDouble(next());
    }
    
    public int[] nextIntArray() throws Exception {
        return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
    }
    
    public String next() throws Exception {
        while (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
    
}