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.*;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.StringTokenizer;

public class Solution747C {
    public static void main(String... bob) throws Exception {
        FAST in = new FAST();
        WriteMe out;
        out = new WriteMe();
        int numServers = in.nextInt(), numTasks = in.nextInt();
        Task[] tasks = new Task[numTasks];
        int[] servers = new int[numServers];

        for (int i = 0; i < numTasks; i++) {
            tasks[i] = new Task(in.nextInt(), in.nextInt(), in.nextInt());
        }
        Arrays.sort(tasks);

        for (int i = 0; i < numTasks; i++) {
            Task cur = tasks[i];
            List<Integer> usableServers = new ArrayList<>();
            for (int j = 0; j < numServers; j++) {
                if (servers[j] <= cur.timeStart) {
                    usableServers.add(j);
                    if (usableServers.size() == cur.servers) {
                        break;
                    }
                }
            }
            if (usableServers.size() < cur.servers) {
                System.out.println(-1);
            } else {
                usableServers.forEach(serverId -> servers[serverId] = cur.timeStart + cur.timeNeeded);
                System.out.println(usableServers.stream().reduce((a, b) -> a + b).get() + usableServers.size());
            }
        }

        out.close();
    }

    static class Task implements Comparable<Task> {
        int timeStart, servers, timeNeeded;

        public Task(int timeStart, int servers, int timeNeeded) {
            this.timeStart = timeStart;
            this.servers = servers;
            this.timeNeeded = timeNeeded;
        }

        @Override
        public int compareTo(Task o) {
            return timeStart - o.timeStart;
        }
    }

    static class WriteMe {
        private PrintWriter out;

        public WriteMe() {
            try {
                out = new PrintWriter(new BufferedWriter(new FileWriter("Solution747C.out")));
            } catch (Exception e) {

            }
        }

        public void caseInt(int num, int ans) {
            caseStr(num, String.valueOf(ans));
        }

        public void caseStr(int num, String ans) {
            out.printf("Case #%d: %s\n", num, ans);
        }

        public void writeln(String str) {
            out.println(str);
        }

        public void write(String str) {
            out.print(str);
        }

        public void close() {
            out.close();
        }
    }

    static class FAST {
        private BufferedReader in;
        private StringTokenizer str;

        public FAST() {
            in = new BufferedReader(new InputStreamReader(System.in));
            // in = new BufferedReader(new FileReader("Solution747C.in"));
        }

        private String next() {
            while (str == null || !str.hasMoreElements()) {
                try {
                    str = new StringTokenizer(in.readLine());
                } catch (IOException e) {
                }
            }
            return str.nextToken();
        }

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

        public long nextLong() {
            return Long.parseLong(next());
        }

        public String nextLine() throws Exception {
            return in.readLine();
        }
    }
}
