import sys
input = sys.stdin.readline


def main():
    N, M = map(int, input().split())
    A = list(map(int, input().split()))
    Q = int(input())
    A_square = [a**2 for a in A]
    st = SegTree(A_square, op, 0)
    for _ in range(Q):
        c, k, d = map(int, input().split())
        c, d = c - 1, d - 1
        cn = int(st.get_value(c)**(1 / 2))
        dn = int(st.get_value(d)**(1 / 2))
        st.update(c, (cn - k)**2)
        st.update(d, (dn + k)**2)
        print(st.query(0, M))
        

def op(x, y):
    return x + y


class SegTree:
    def __init__(self, ls, op, e):
        n = len(ls)
        self.op = op
        self.e = e
        self.size = 1 << (n - 1).bit_length()
        self.tree = [self.e] * (2 * self.size)
        # 葉に対象の列を格納
        for i in range(n):
            self.tree[self.size + i] = ls[i]
        # 葉に近い場所から順に更新
        for i in range(self.size - 1, 0, -1):
            self.tree[i] = self.op(self.tree[2 * i], self.tree[2 * i + 1])

    def update(self, k, x):
        # 葉に移動
        k += self.size
        # 関連する場所を更新
        self.tree[k] = x
        while k > 1:
            self.tree[k >> 1] = self.op(self.tree[k], self.tree[k ^ 1])
            k >>= 1
        
    def query(self, l, r):
        res = self.e
        # 葉に移動
        l += self.size
        r += self.size        
        # 未計算の区間がなくなるまで
        while l < r:
            if l & 1:
                res = self.op(res, self.tree[l])
                l += 1
            if r & 1:
                res = self.op(res, self.tree[r - 1])
            # 親に移動
            l >>= 1
            r >>= 1
        return res

    def get_value(self, k):
        return self.tree[k + self.size]


main()