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.*;
import java.util.*;

import javax.naming.NameAlreadyBoundException;

public class Geometry {

	static final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;

	public static void main(String[] args) {
		new Geometry().run();
	}

	BufferedReader in;
	PrintWriter out;
	StringTokenizer tok;

	void init() throws FileNotFoundException {

		if (ONLINE_JUDGE) {
			in = new BufferedReader(new InputStreamReader(System.in));
			out = new PrintWriter(System.out);
		} else {
			in = new BufferedReader(new FileReader("input.txt"));
			out = new PrintWriter("output.txt");
		}

		tok = new StringTokenizer("");
	}

	void run() {
		try {
			long timeStart = System.currentTimeMillis();

			init();
			solve();

			out.close();

			long timeEnd = System.currentTimeMillis();
			System.err.println("Time = " + (timeEnd - timeStart) + " COMPILED");
		} catch (Exception e) {
			e.printStackTrace();
			System.exit(-1);
		}
	}

	String readLine() throws IOException {
		return in.readLine();
	}

	String delimiter = " ";

	String readString() throws IOException {
		while (!tok.hasMoreTokens()) {
			String nextLine = readLine();
			if (null == nextLine)
				return null;

			tok = new StringTokenizer(nextLine);
		}

		return tok.nextToken(delimiter);
	}

	int[] readArray(int a[]) {
		for (int i = 0; i < a.length; i++) {
			try {
				a[i] = readInt();
			} catch (IOException e) {
				e.printStackTrace();
			}
		}
		return a;
	}

	int readInt() throws IOException {
		return Integer.parseInt(readString());
	}

	long readLong() throws IOException {
		return Long.parseLong(readString());
	}

	void solve() throws IOException {
		int n = readInt();
		int q = readInt();
		int[] timeServActiveEnd = new int[n];
		Arrays.fill(timeServActiveEnd, 0);
		int[][] a = new int[q][3];
		for (int i = 0; i < q; i++) {
			a[i][0] = readInt();
			a[i][1] = readInt();
			a[i][2] = readInt();
		}

		int[] times = new int[a[q - 1][0] + 1];
		Arrays.fill(times, n);
		int i = 0;
		for (int TIME = 1; TIME <= 1000 * 1000; TIME++) {
			if (a[i][0] == TIME) {
				int ServsIntThisTime = times[TIME - 1];
				if (a[i][1] <= ServsIntThisTime) {
					for (int t = TIME - 1; t <Math.min( TIME +a[i][2],times.length)-1;t++) {
						times[t] -= a[i][1];
					}

					int summ = 0;
					int s = 0;
					int flag = 0;
					while (s< a[i][1] ) {
						if (timeServActiveEnd[flag] <= TIME) {
							s++;
							summ += flag + 1;
							timeServActiveEnd[flag] = TIME + a[i][0];

						}
						if (flag < timeServActiveEnd.length - 1) {
							flag++;
						} else
							break;

					}
					out.println(summ);

				} else {
					out.println(-1);
				}
				if (i < q - 1) {
					i++;
				} else
					return;

			}

		}

	}
}
