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.*;


public class Main {
    public static class Task{
        public int start;
        public int servers;
        public int time;

        public Task(int start, int servers, int time) {
            this.start = start;
            this.servers = servers;
            this.time = time;
        }
    }
    public static void main(String[] args) {
        Scanner SC = new Scanner(System.in);
        int n = SC.nextInt();
        int q = SC.nextInt();
        ArrayList<Task> tasks = new ArrayList<>();
        for(int i=0; i<q; i++){
            tasks.add(new Task(SC.nextInt(), SC.nextInt(), SC.nextInt()));
        }
        int[] uss = new int[tasks.get(tasks.size()-1).start+tasks.get(tasks.size()-1).time-1];
        int sum;
        for(Task x : tasks){
            sum=0;
            if(n-uss[x.start-1]>=x.servers) {
                for(int i=uss[x.start-1]+1; i<uss[x.start-1]+x.servers+1; i++){
                    sum+=i;
                }
                for (int i = x.start - 1; i < x.start + x.time - 1; i++) {
                    uss[i] += x.servers;
                }
                System.out.println(sum);
            }
            else{
                System.out.println(-1);
            }
        }
    }
}