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

# n,q=map(int,raw_input().split())

# tasks = []

# availableServer = [0 for _ in xrange(n+1)]

# for i in xrange(q):
# 	time, numberOfServerNeeded, timeToComplete =map(int,raw_input().split())	

# 	usedServer = []

# 	# Get servers to use
# 	for j in xrange(1, len(availableServer)):
# 		if availableServer[j] <= time:
# 			usedServer.append(j)

# 		if len(usedServer) == numberOfServerNeeded:
# 			break

# 	if len(usedServer) != numberOfServerNeeded:
# 		print("-1")
# 	else:
# 		print(sum(usedServer))
# 		for server in usedServer:
# 			availableServer[server] = time + timeToComplete

n,q=map(int,raw_input().split())

tasks = []

for i in xrange(q):
	time, numberOfServer, timeToComplete =map(int,raw_input().split())	
	tasks.append([time, numberOfServer, timeToComplete])

import heapq

heap = []

totalServer = n
usedServer = 0

availableServer = [0 for _ in xrange(n+1)]
availableServer[0] = -1

for task in tasks:

	time, numberOfServer, timeToComplete = task
	freeAfter = time + timeToComplete
	usedServerId = []
	

	while heap and heap[0][0] <= time:
		finish = heapq.heappop(heap)

		#Free up Server
		serverList = finish[4]
		usedServer -= len(serverList)

		for i in serverList:
			availableServer[i] = 0
		

	if totalServer - usedServer >= numberOfServer:
		#allocate server
		i = numberOfServer
		# print(availableServer)
		for j, value in enumerate(availableServer):
			if value == 0:
				usedServerId.append(j)
				availableServer[j] = 1
				usedServer += 1
				i -= 1

			if i == 0:
				break
		heapq.heappush(heap, [freeAfter, time, numberOfServer, timeToComplete, usedServerId])
		print(sum(usedServerId))
	else:
		print(-1)