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.lang.reflect.Array;
import java.util.*;

public class Main {
    public static void main(String[] args) throws FileNotFoundException, IOException {
        InputStream inputStream = System.in;
//        InputStream inputStream = new FileInputStream("dijkstra.in");
        OutputStream outputStream = System.out;
//        OutputStream outputStream = new FileOutputStream("dijkstra.out");
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Answer solver = new Answer();
        solver.solve(1, in, out);
        out.close();
    }

    static class Answer {
        public void solve(int testNumber, InputReader in, PrintWriter out) throws IOException {
            int n = in.nextInt();
            int q = in.nextInt();

            List<Task> a = new ArrayList<>();
            for (int i = 0; i < q; i++) {
                int t = in.nextInt();
                int k = in.nextInt();
                int d = in.nextInt();
                a.add(new Task(t, k, d, i));
            }

            Collections.sort(a, new Comparator<Task>() {
                @Override
                public int compare(Task o1, Task o2) {
                    return o1.t - o2.t;
                }
            });

            int[] ans = new int[q];
            long[] times = new long[n];

            for (int i = 0; i < q; i++) {
                Task task = a.get(i);

                int kol = 0;
                for (int j = 0; j < n; j++) {
                    if (times[j] < task.t) {
                        ans[task.index] += j + 1;
                        times[j] = task.t + task.d - 1;
                        kol++;
                        if (kol == task.k) {
                            break;
                        }
                    }
                }
                if (kol < task.k) {
                    ans[task.index] = -1;
                }
            }

            for (int i = 0; i < q; i++) {
                out.println(ans[i]);
            }
        }

        private class Task {
            int t;
            int k;
            int d;
            int index;

            public Task(int t, int k, int d, int index) {
                this.t = t;
                this.k = k;
                this.d = d;
                this.index = index;
            }
        }
    }

    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());
        }

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

        public List<Integer> nextIntArrayList(int n) {
            List<Integer> a = new ArrayList<>();
            for (int i = 0; i < n; i++) {
                int x = nextInt();
                a.add(x);
            }
            return a;
        }

        public int[] nextIntArray(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++) {
                a[i] = nextInt();
            }
            return a;
        }

        public long[] nextLongArray(int n) {
            long[] a = new long[n];
            for (int i = 0; i < n; i++) {
                a[i] = nextLong();
            }
            return a;
        }
    }
}