100 1
1000000 100 1000
 5 3
1 4 10
2 2 5
3 1 6
 10 4
1 5 20
2 5 200
100 6 20
101 1 100
 5 3
1 3 4
4 3 4
6 4 1
 4 1
6 1 1
 8 6
1 3 20
4 2 1
6 6 5
9 1 1
15 3 6
21 8 8
 4 5
1 2 3
2 1 3
3 1 2
4 3 3
5 4 1
 8 4
1 3 2
2 3 100
10 6 20
11 5 20
 4 10
1 1 1
3 1 2
4 1 2
6 1 2
8 1 2
13 1 2
16 1 1
17 1 2
19 3 1
20 1 1
 5 3
1 4 4
4 2 2
5 5 2
 4 3
1 3 10
2 2 15
12 4 1
 5 4
1 1 4
2 4 4
5 2 20
11 5 2
 1 10
4 1 1
9 1 1
10 1 1
12 1 1
13 1 1
15 1 1
16 1 1
18 1 1
19 1 1
20 1 1

5050
 10
-1
5
 15
40
-1
1
 6
-1
10
 1
 6
9
-1
4
15
36
 3
3
4
-1
10
 6
15
-1
21
 1
1
2
1
1
1
1
1
6
1
 10
-1
15
 6
-1
10
 1
14
-1
15
 1
1
1
1
1
1
1
1
1
1

from sys import stdin, stdout
from collections import deque
n, q = map(int, stdin.readline().split())
queue = deque()
cnt = 0


def mergesort(l, r):
    if r != l:
        ind = (r + l) // 2
        mergesort(l, ind)
        mergesort(ind + 1, r)
        merge(l, ind, ind + 1, r)


def merge(lf, rf, ls, rs):
    a = []
    ind1 = lf
    ind2 = ls
    
    while (ind1 <= rf and ind2 <= rs):
        if queue[ind1] < queue[ind2]:
            a.append(queue[ind1])
            ind1 += 1
        else:
            a.append(queue[ind2])
            ind2 += 1
    
    while (ind1 <= rf):
        a.append(queue[ind1])
        ind1 += 1
    
    while (ind2 <= rs):
        a.append(queue[ind2])
        ind2 += 1
    
    for i in range(lf, rs + 1):
        queue[i] = a[i - lf]
            

used = [0 for i in range(n + 1)]
label = 1
for i in range(q):
    s = set()
    tc, k, tp = map(int, stdin.readline().split())
    
    if queue:
        mergesort(0, len(queue) - 1)
    
    while (queue and tc >= queue[0][0]):
        s.add(queue[0][2])
        cnt -= queue[0][1]
        queue.popleft()

    for i in range(1, n + 1):
        if used[i] in s:
            used[i] = 0
    
    if cnt + k <= n:
        ans = 0
        value = 0
        for i in range(1, n + 1):
            if not used[i]:
                ans += i
                value += 1
                used[i] = label
            if value == k:
                break
            
        stdout.write(str(ans) + '\n')
        cnt += k
        queue.append((tc + tp, k, label))
        label += 1
    else:
        stdout.write('-1\n')
        