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.PrintStream;
import java.util.LinkedList;
import java.util.List;
import java.util.PriorityQueue;
import java.util.Scanner;

public class CF747C {
	/**
	 * solution result
	 */
	public static class Answer {
		List<Integer> a;
		public Answer(List<Integer> a) {
			this.a = a;
		}

		@Override
		public String toString() {
			StringBuffer sb = new StringBuffer();
			for (int n:a) {
				sb.append(n);
				sb.append('\n');
			}
			return sb.toString();
		}
	};

	
	static class Task implements Comparable<Task> {
		int timeIn;
		int serversLoad;
		int timeWork;
		int timeEnd;
		long busySum;
		int servers[];
		Task(int ti, int sl, int tw) {
			timeIn = ti;
			serversLoad = sl;
			timeWork = tw;
			timeEnd = timeIn+timeWork;
			busySum = 0;
			servers = null;
		}
		@Override
		public int compareTo(Task o) {
			return timeEnd - o.timeEnd;
		}
	}
	
	/**
	 * input parser
	 */
	public static class Input {
		int nservers;
		int ntasks;
		Task task[];
		public Input(Scanner sc) {
			nservers = sc.nextInt();
			ntasks = sc.nextInt();
			task = new Task[ntasks];
			for (int i=0; i<ntasks; i++)
				task[i] = new Task(sc.nextInt(), sc.nextInt(), sc.nextInt());
		}
	};

	/**
	 * solver function
	 */
	public static Answer solve(Input in) {
		List<Integer> res = new LinkedList<>();
		PriorityQueue<Task> pt = new PriorityQueue<>();
		int timeNow;
		Task task[] = in.task;
		int nBusy = 0;
		boolean busy[] = new boolean[in.nservers];
		for (int i=0; i<task.length; i++) {
			timeNow = task[i].timeIn;
			while (!pt.isEmpty() && pt.peek().timeEnd <= timeNow) {
				Task head = pt.remove();
				nBusy -= head.serversLoad;
				for (int j=0; j<head.servers.length; j++)
					busy[head.servers[j]] = false;
			}
			if (in.nservers-nBusy >= task[i].serversLoad) {
				pt.add(task[i]);
				nBusy += task[i].serversLoad;
				int s[] = new int[task[i].serversLoad];
				int ns = 0;
				int cnt = 0;
				for (int j=0; j<busy.length && ns<s.length; j++) {
					if (!busy[j]) {
						s[ns++] = j;
						busy[j] = true;
						cnt += j+1;
					}
				}
				task[i].servers = s;
				res.add(cnt);
			} else {
				res.add(-1);
			}
		}
		Answer ans = new Answer(res);
		return ans;
	}

	/**
	 * standard CodeForces executable mantra
	 */
	public static void proc(Scanner sc, PrintStream out) {
		Input in = new Input(sc);
		out.println(solve(in));
	}

	public static void main(String[] args) {
		try (Scanner sc = new Scanner(System.in)) {
			proc(sc, System.out);
		}
	}
}
