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.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.NoSuchElementException;

public class C {
	int n,q;
	int[] t,k,d;
	int[] server;
	Task[] tasks;
	class Task implements Comparable<Task>{
		int t,k,d;
		public Task(int t,int k,int d){
			this.t = t;
			this.k = k;
			this.d = d;
		}

		public int compareTo(Task task){
			return this.t - task.t;
		}
	}

	public void solve() {
		n = nextInt();
		q = nextInt();
		t = new int[q];
		k = new int[q];
		d = new int[q];
		server = new int[n];
		tasks = new Task[q];

		Arrays.fill(server, 1);
		for(int i = 0;i < q;i++){
			t[i] = nextInt();
			k[i] = nextInt();
			d[i] = nextInt();

			tasks[i] = new Task(t[i],k[i],d[i]);
		}

		for(int i = 0;i < q;i++){

			int remain = tasks[i].k;
			int sum = 0;
			int cnt = 0;
			for(int j = 0;j < n;j++){
				if(server[j] <= tasks[i].t){
					cnt++;
				}
			}

			if(remain <= cnt){
				for(int j = 0;remain > 0 && j < n;j++){

					if(server[j] <= tasks[i].t){
						server[j] = tasks[i].t + tasks[i].d;
						remain--;
						sum += (j + 1);
					}
				}
			}

			if(remain > cnt){
				out.println(-1);
			}else{
				out.println(sum);
			}

		}
	}

	public static void main(String[] args) {
		out.flush();
		new C().solve();
		out.close();
	}

	/* Input */
	private static final InputStream in = System.in;
	private static final PrintWriter out = new PrintWriter(System.out);
	private final byte[] buffer = new byte[2048];
	private int p = 0;
	private int buflen = 0;

	private boolean hasNextByte() {
		if (p < buflen)
			return true;
		p = 0;
		try {
			buflen = in.read(buffer);
		} catch (IOException e) {
			e.printStackTrace();
		}
		if (buflen <= 0)
			return false;
		return true;
	}

	public boolean hasNext() {
		while (hasNextByte() && !isPrint(buffer[p])) {
			p++;
		}
		return hasNextByte();
	}

	private boolean isPrint(int ch) {
		if (ch >= '!' && ch <= '~')
			return true;
		return false;
	}

	private int nextByte() {
		if (!hasNextByte())
			return -1;
		return buffer[p++];
	}

	public String next() {
		if (!hasNext())
			throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = -1;
		while (isPrint((b = nextByte()))) {
			sb.appendCodePoint(b);
		}
		return sb.toString();
	}

	public int nextInt() {
		return Integer.parseInt(next());
	}

	public long nextLong() {
		return Long.parseLong(next());
	}

	public double nextDouble() {
		return Double.parseDouble(next());
	}
}