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 C {
    public static void main(String[] args) throws IOException {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(in.readLine());
        int n = Integer.parseInt(st.nextToken());
        int q = Integer.parseInt(st.nextToken());
        LinkedList<Triple> tasks = new LinkedList<Triple>();
        PriorityQueue<Triple> ress = new PriorityQueue<Triple>();
        for (int i = 0; i < q; i++) {
            st = new StringTokenizer(in.readLine());
            int a = Integer.parseInt(st.nextToken());
            int b = Integer.parseInt(st.nextToken());
            int c = Integer.parseInt(st.nextToken());
            tasks.add(new Triple(a, b, c));
        }
        int[] machines = new int[n];
        for (int i = 0; i < n; i++) {
            machines[i] = 0;
        }
        int machines_available = n;
        while (!tasks.isEmpty() || !ress.isEmpty()) {
            if (tasks.isEmpty() || (!ress.isEmpty() && ress.peek().a <= tasks.peek().a)) {
                Triple res = ress.poll();
                for (int i = 0; i < n; i++) {
                    if (machines[i] == res.b) {
                        machines[i] = 0;
                        machines_available++;
                    }
                }
            } else {
                Triple task = tasks.poll();
                if (machines_available < task.b) {
                    System.out.println("-1");
                } else {
                    int c = task.b, sum = 0;
                    for (int i = 0; i < n; i++) {
                        if (machines[i] == 0) {
                            machines[i] = task.a;
                            machines_available--; c--;
                            sum += i + 1;
                            if (c == 0) break;
                        }
                    }
                    System.out.println(sum);
                    ress.add(new Triple(task.a + task.c, task.a, -1));
                }
            }
        }
        System.exit(0);
    }

    private static class Triple implements Comparable<Triple> {

        public int a;
        public int b;
        public int c;

        public Triple(int a, int b, int c) {
            this.a = a;
            this.b = b;
            this.c = c;
        }

        public int compareTo(Triple other) {
            return this.a - other.a;
        }
    }
}