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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.AbstractCollection;
import java.util.List;
import java.util.PriorityQueue;
import java.util.Scanner;
import java.util.Comparator;
import java.util.ArrayList;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author heifrank
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        CF747C solver = new CF747C();
        solver.solve(1, in, out);
        out.close();
    }

    static class CF747C {
        PriorityQueue<Integer> servers;
        PriorityQueue<Task> tasks;

        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt(), q = in.nextInt();

            servers = new PriorityQueue<>(n);
            for (int i = 0; i < n; i++) {
                servers.add(i + 1);
            }
            tasks = new PriorityQueue<>(5, new Comparator<Task>() {

                public int compare(Task o1, Task o2) {
                    return o1.endTime < o2.endTime ? -1 : 1;
                }
            });

            for (int i = 0; i < q; i++) {
                int t = in.nextInt(), k = in.nextInt(), d = in.nextInt();
                out.println(can(t, k, d));
            }

        }

        int can(int t, int k, int d) {
            while (!tasks.isEmpty()) {
                Task task = tasks.peek();
                if (task.endTime < t) {
                    for (Integer server : task.servers) {
                        servers.offer(server);
                    }
                    tasks.poll();
                } else {
                    break;
                }
            }

            if (k > servers.size()) {
                return -1;
            }

            List<Integer> taskServers = new ArrayList<>();
            int ans = 0;
            while (k-- > 0) {
                int num = servers.poll();
                taskServers.add(num);
                ans += num;
            }
            tasks.add(new Task(t + d - 1, taskServers));
            return ans;
        }

        class Task {
            int endTime;
            List<Integer> servers;

            public Task(int endTime, List<Integer> servers) {
                this.endTime = endTime;
                this.servers = servers;
            }

        }

    }
}

