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

#include <bits/stdc++.h>
using namespace std;
const int MAX = 100010;
struct Node {
  int t, k, d, index;
  bool operator<(const Node& args) const { return t < args.t; }
} p[MAX];
int a[110], ans[MAX];
int main(int argc, char const* argv[]) {
  int n, q;
  while (scanf("%d %d", &n, &q) != EOF) {
    for (int i = 0; i < q; i++) {
      scanf("%d%d%d", &p[i].t, &p[i].k, &p[i].d);
      p[i].index = i;
    }
    sort(p, p + q);
    memset(a, 0, sizeof(a));
    memset(ans, 0, sizeof(ans));
    for (int i = 0; i < q; i++) {
      int x = p[i].t, y = p[i].k, z = p[i].d, b = p[i].index;
      int c = 0;
      for (int j = 1; j <= n; j++) {
        if (a[j] < x) {
          c++;
        }
      }
      if (c < y) {
        ans[b] = -1;
        continue;
      }
      for (int j = 1; j <= n; j++) {
        if (a[j] < x && y > 0) {
          a[j] = x + z - 1;
          y--;
          ans[b] += j;
        }
      }
    }
    for (int i = 0; i < q; i++) {
      printf("%d\n", ans[i]);
    }
  }
  return 0;
}
