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.BufferedReader;
import java.io.InputStreamReader;
import java.util.TreeSet;
import java.util.ArrayList;
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;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        CServers solver = new CServers();
        solver.solve(1, in, out);
        out.close();
    }

    static class CServers {
        int n;
        int q;
        int[][] queries;

        public void readInput(Scanner sc) {
            n = sc.nextInt();
            q = sc.nextInt();
            queries = new int[q][4];
            for (int i = 0; i < q; i++) {
                for (int j = 0; j < 3; j++) {
                    queries[i][j] = sc.nextInt();
                }
                queries[i][3] = i;
            }
        }

        public void solve(int testNumber, Scanner sc, PrintWriter pw) {
            int tc = 1;
            while (tc-- > 0) {
                readInput(sc);
                Arrays.sort(queries, (a, b) -> a[0] - b[0]);
                TreeSet<Integer> set = new TreeSet<>();
                for (int i = 1; i <= n; i++)
                    set.add(i);
                int idx = 0;
                ArrayList<Integer>[] lists = new ArrayList[(int) 2e6 + 1];
                for (int i = 0; i < lists.length; i++)
                    lists[i] = new ArrayList<>();
                int[] ans = new int[q];
                for (int time = 1; time <= (int) 1e6; time++) {
                    for (int x : lists[time])
                        set.add(x);
                    if (idx < q && queries[idx][0] == time) {
                        if (set.size() >= queries[idx][1]) {
                            int temp = 0;
                            for (int i = 0; i < queries[idx][1]; i++) {
                                temp += set.first();
                                lists[time + queries[idx][2]].add(set.pollFirst());
                            }
                            ans[queries[idx][3]] = temp;
                        } else
                            ans[queries[idx][3]] = -1;
                        idx++;
                    }
                }
                for (int i = 0; i < q; i++)
                    pw.println(ans[i]);
            }
        }

    }

    static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

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

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

    }
}

