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

public class Solution {
	public static void main(String[] args) throws IOException {
		BufferedWriter wri = new BufferedWriter(new OutputStreamWriter(System.out));
        BufferedReader rea = new BufferedReader(new InputStreamReader(System.in));
		problemC(wri, rea);
		wri.close();
	}
	
	public static void problemC(BufferedWriter dos, BufferedReader dis) throws IOException {
		StringTokenizer st = new StringTokenizer(dis.readLine());
        int n = Integer.parseInt(st.nextToken());
		int p = Integer.parseInt(st.nextToken());
		
		int[] timeToFreeServer = new int[n];		
		for(int j = 0; j < p; j++) {
			st = new StringTokenizer(dis.readLine());
			int t = Integer.parseInt(st.nextToken());
			int k = Integer.parseInt(st.nextToken());
			int d = Integer.parseInt(st.nextToken());
			
			int numFree = 0, q = 0;
			int[] serversToUse = new int[k];
			for(int m = 0; m < n && numFree < k; m++) {
				if(t >= timeToFreeServer[m]) {
					numFree++;
					serversToUse[q++] = m;					
				}
			}
			
			if(numFree < k) dos.write(String.valueOf(-1));
			else {
				int sumFree = 0;
				for(int i = 0; i < k; i++) {
					sumFree += serversToUse[i] + 1;
					timeToFreeServer[serversToUse[i]] = t + d;
				}
				dos.write(String.valueOf(sumFree));
			}
			dos.newLine();			
		}
	}
}