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.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.InputMismatchException;

public class C_747 {
	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

	public static void main(String[] args) throws NumberFormatException, IOException {
		int n = nextInt();
		int q = nextInt();
		
		int[] servers = new int[n];
		Arrays.fill(servers, 0);
		
		Triplet[] triplets = new Triplet[q];
		
		for (int i=0; i<q; i++) {
			int t = nextInt();
			int k = nextInt();
			int d = nextInt();
			triplets[i] = new Triplet(t,k,d);
		}
		
		Arrays.sort(triplets);
		int time=0;
		
		for (int i=0; i<q; i++) {
			if(time>triplets[i].t) {
				System.out.println(-1);
			} else {
				int sum=0, count=0;
				
				for(int j=0; j<n; j++) {
					if (servers[j] <= triplets[i].t) {
						count++;
					}
				}
				
				if (count>=triplets[i].k) {
					count=0;
					for (int j=0; count!=triplets[i].k && j<n; j++) {
						if (servers[j] <= triplets[i].t) {
							count++;
							sum+=(j+1);
							servers[j] = triplets[i].t + triplets[i].d;
						}
					}
					System.out.println(sum);
				} else {
					System.out.println(-1);
				}
			}
		}
		
	}

	static int read() throws IOException {
		return br.read();
	}

	static int nextInt() throws IOException {
		int c = read();
		while (isSpaceChar(c)) {
			c = read();
		}
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		int res = 0;
		do {
			if (c < '0' || c > '9') {
				throw new InputMismatchException();
			}
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	}

	static long nextLong() throws NumberFormatException, IOException {
		int c = read();
		while (isSpaceChar(c)) {
			c = read();
		}
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		long res = 0;
		do {
			if (c < '0' || c > '9') {
				throw new InputMismatchException();
			}
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	}

	static int[] readIntegerArray(int n) throws IOException {
		int[] arr = new int[n];

		String input;

		while ((input = br.readLine()) != null) {

			if (input != null && !input.equals("")) {
				break;
			}
		}
		
		String[] strArr = input.split(" ");
		
		for (int i = 0; i < n; i++) {
			arr[i] = Integer.parseInt(strArr[i]);
		}
		
		return arr;
	}

	static long[] readlongArray(int n) throws IOException {
		long[] arr = new long[n];

		String input;

		while ((input = br.readLine()) != null) {

			if (input != null && !input.equals("")) {
				break;
			}
		}
		String[] strArr = input.split(" ");

		for (int i = 0; i < n; i++) {
			arr[i] = Long.parseLong(strArr[i]);
		}

		return arr;
	}

	static boolean isSpaceChar(int c) {
		return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
	}
}

class Triplet implements Comparable<Triplet>
{
	int t,k,d;
	
	Triplet(int t, int k, int d){
		this.t = t;
		this.k = k;
		this.d = d;
	}

	@Override
	public int compareTo(Triplet o) {
		return o.t > this.t ? -1 : 1;
	}
}
