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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.PriorityQueue;
import java.util.StringTokenizer;

public class Div2_387C {

	public static void main(String[] args) throws IOException {
		new Div2_387C().execute();
	}

	void execute() throws IOException {
		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter printer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));

		StringTokenizer inputData = new StringTokenizer(reader.readLine());
		int numServers = Integer.parseInt(inputData.nextToken());
		int numTasks = Integer.parseInt(inputData.nextToken());

		PriorityQueue<Integer> serverPool = new PriorityQueue<Integer>();
		for (int i = 1; i <= numServers; i++) {
			serverPool.add(i);
		}

		PriorityQueue<Event> returnQueue = new PriorityQueue<Event>();

		for (int cTask = 0; cTask < numTasks; cTask++) {
			inputData = new StringTokenizer(reader.readLine());
			int time = Integer.parseInt(inputData.nextToken());
			int serverNeed = Integer.parseInt(inputData.nextToken());
			int timeNeed = Integer.parseInt(inputData.nextToken());

			while (!returnQueue.isEmpty() && returnQueue.peek().key < time) {
				serverPool.add(returnQueue.remove().value);
			}

			if (serverPool.size() >= serverNeed) {
				int finishingTime = time + timeNeed - 1;

				int sum = 0;
				for (int i = 0; i < serverNeed; i++) {
					int server = serverPool.remove();
					returnQueue.add(new Event(finishingTime, server));
					sum += server;
				}
				printer.println(sum);
			} else {
				printer.println(-1);
			}
		}
		reader.close();
		printer.close();
	}

	class Event implements Comparable<Event> {
		int key;
		int value;

		Event(int key, int value) {
			this.key = key;
			this.value = value;
		}

		public int compareTo(Event o) {
			return Integer.compare(key, o.key);
		}
	}

}
