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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;

public class Main {

    static BufferedReader in;
    static PrintWriter out;
    static StringTokenizer tok;

    void solve() throws IOException {
        int n = ni(), q = ni();

        ArrayList<Pair> list = new ArrayList<>();

        for (int i = 0; i < q; i++) {
            int t = ni() - 1;
            int k = ni();
            int d = ni();

            list.add(new Pair(t, k, d));
        }

        Collections.sort(list);

        int idx = 0;
        int[] canuse = new int[n];

        for (int i = 0; i < 1100000; i++) {
            if (i == list.get(idx).x) {
                int k = list.get(idx).y;
                int d = list.get(idx).z;

                ArrayList<Integer> l = new ArrayList<>();

                for (int j = 0; j < n; j++) {
                    if (canuse[j] <= i) {
                        l.add(j);
                        k--;
                        if (k == 0) {
                            break;
                        }
                    }
                }

                if (k > 0) {
                    out.println(-1);
                } else {
                    int sum = 0;
                    for (int j = 0; j < l.size(); j++) {
                        sum += l.get(j) + 1;
                        canuse[l.get(j)] = i + d;
                    }
                    out.println(sum);
                }

                idx++;
                if (idx == q) break;
            }
        }
    }

    public class Pair implements Comparable<Pair> {
    	int x, y, z;

    	Pair(int x, int y, int z) {
    		this.x = x;
            this.y = y;
            this.z = z;
    	}

    	public int compareTo(Pair p) {
    		return x - p.x;
    	}
    }

    String ns() throws IOException {
        while (!tok.hasMoreTokens()) {
            tok = new StringTokenizer(in.readLine(), " ");
        }
        return tok.nextToken();
    }

    int ni() throws IOException {
        return Integer.parseInt(ns());
    }

    long nl() throws IOException {
        return Long.parseLong(ns());
    }

    double nd() throws IOException {
        return Double.parseDouble(ns());
    }

    String[] nsa(int n) throws IOException {
        String[] res = new String[n];
        for (int i = 0; i < n; i++) {
            res[i] = ns();
        }
        return res;
    }

    int[] nia(int n) throws IOException {
        int[] res = new int[n];
        for (int i = 0; i < n; i++) {
            res[i] = ni();
        }
        return res;
    }

    long[] nla(int n) throws IOException {
        long[] res = new long[n];
        for (int i = 0; i < n; i++) {
            res[i] = nl();
        }
        return res;
    }

    public static void main(String[] args) throws IOException {
        in = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
        tok = new StringTokenizer("");
        Main main = new Main();
        main.solve();
        out.close();
    }
}