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.Arrays;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

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

    static class TaskC {
        public void solve(int testNumber, MyBufferedReader in, PrintWriter out) {
            int[] data = in.getALineOfInts(2);
            int n = data[0];
            int q = data[1];

            int[] t = new int[q];
            int[] k = new int[q];
            int[] d = new int[q];
            for (int i = 0; i < q; i++) {
                data = in.getALineOfInts(3);
                t[i] = data[0];
                k[i] = data[1];
                d[i] = data[2];
            }

            int TASK = 0;
            int START = 1;
            int[][] serverTasks = new int[n][2];
            for (int[] st : serverTasks) {
                Arrays.fill(st, -1);
            }

            for (int i = 0; i < q; i++) {
                int currTime = t[i];
                int unocc = 0;
                for (int j = 0; j < n; j++) {
                    if (serverTasks[j][TASK] != -1) {
                        if (currTime >= serverTasks[j][START] + d[serverTasks[j][TASK]]) {
                            serverTasks[j][TASK] = -1;
                            serverTasks[j][START] = -1;
                        }
                    }

                    if (serverTasks[j][TASK] == -1) {
                        unocc++;
                    }
                }

                if (unocc >= k[i]) {
                    int toAdd = k[i];
                    int sum = 0;
                    for (int j = 0; j < n && toAdd > 0; j++) {
                        if (serverTasks[j][TASK] == -1) {
                            serverTasks[j][TASK] = i;
                            serverTasks[j][START] = currTime;
                            toAdd--;
                            sum += j + 1;
                        }
                    }

                    out.println(sum);
                } else {
                    out.println("-1");
                }

            }
        }

    }

    static class MyBufferedReader {
        BufferedReader in;

        public MyBufferedReader(InputStream s) {
            this.in = new BufferedReader(new InputStreamReader(s));
        }

        public int[] getALineOfInts(int numExpected) {
            int[] res = new int[numExpected];
            StringTokenizer st = null;
            try {
                st = new StringTokenizer(in.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
            for (int i = 0; i < numExpected; i++)
                res[i] = Integer.parseInt(st.nextToken());
            return res;
        }

    }
}

