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

public class Main {
    static Scanner scan = new Scanner(System.in);
    static PrintStream out = new PrintStream(System.out);
    static boolean[] using;
    static int[] time;
    static int n, q;
    static int t, k, d;
    static int free, sec;
    static int[] done;
    
    public static void main (String[] args) throws IOException {
    	n = scan.nextInt();
    	q = scan.nextInt();
    	free = n;
    	
    	using = new boolean[n];
    	time = new int[n];
    	done = new int[q];
    	
    	for (int i = 0; i < q; i++) {
    		t = scan.nextInt();
    		k = scan.nextInt();
    		d = scan.nextInt();
    		sec = t;
    		int val = 0;
			int c = 0;
			//for (int j = 0; j < n; j++) {out.print(time[j] + " ");}

			for (int j = 0; j < n; j++) {if (time[j] <= sec && using[j] == true) {using[j] = false; free++;}}
    		if (k > free) {
    			done[i] = -1; continue;
    		}
    		
    		for (int j = 0;;j++) {
    			if (!using[j]) {
    				val += j + 1;
    				time[j] = sec + d;
    				c++;
    				using[j] = true;
    				free--;
    				if (c == k) {done[i] = val; break;}
    			}
    		}
    	}
    	
    	for (int i = 0; i < q; i++) {
    		out.println(done[i]);
    	}
    }
}
