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.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.util.Comparator;
import java.util.Collections;
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;
        InputReader in = new InputReader(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, InputReader in, PrintWriter out) {
            final int n = in.nextInt(), q = in.nextInt();
            List<TaskC.Task> tasks = new ArrayList<>();
            for (int i = 0; i < q; i++) {
                tasks.add(new TaskC.Task(in.nextInt(), in.nextInt(), in.nextInt(), i));
            }
            Collections.sort(tasks, new Comparator<TaskC.Task>() {

                public int compare(TaskC.Task o1, TaskC.Task o2) {
                    return Integer.compare(o1.time, o2.time);
                }
            });

            int[] free = new int[n + 1];
            int[] res = new int[q];
            for (int i = 0; i < q; i++) {
                TaskC.Task task = tasks.get(i);
                res[i] = find(task, free, n);
            }
            for (int r : res) {
                out.println(r);
            }
        }

        private int find(TaskC.Task task, int[] free, int n) {
            int cnt = 0;
            for (int i = 1; i <= n; ++i) {
                if (free[i] <= task.time)
                    cnt++;
            }
            if (cnt < task.servers) return -1;
            cnt = 0;
            int r = 0;
            for (int i = 1; i <= n; ++i) {
                if (free[i] <= task.time) {
                    cnt++;
                    r += i;
                    free[i] = task.time + task.duration;
                    if (cnt == task.servers) break;
                }
            }
            return r;
        }

        static class Task {
            int time;
            int servers;
            int duration;
            int id;

            Task(int tt, int ss, int dd, int id) {
                time = tt;
                servers = ss;
                duration = dd;
                this.id = id;
            }

        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}

