import sys # sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() # dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = 10**20 # md = 998244353 # md = 10**9+7 from heapq import * n,m=LI() bb=LI() bb=[-b if i&1 else b for i,b in enumerate(bb)] hp=[] for _ in range(m): l,r=LI() l-=1 heappush(hp,(l,r)) def ok(): now=0 cs=[0]*(n+1) for i,b in enumerate(bb): now+=cs[i] pr=-1 if hp and hp[0][0]==i: l,r=heappop(hp) cs[r]-=b-now now=b pr=r while hp and hp[0][0]==i: l,r=heappop(hp) if pr