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 maxn = 105;
const int maxq = 100005;
int n, q;
struct node {
  int t, k, d;
  node(int t = 0, int k = 0, int d = 0) : t(t), k(k), d(d) {}
};
node tsk[maxq];
void init() {
  scanf("%d%d", &n, &q);
  for (int i = 1; i <= q; ++i) {
    int t, k, d;
    scanf("%d%d%d", &t, &k, &d);
    tsk[i] = node(t, k, d);
  }
}
int ddl[maxn];
bool ys[maxn];
void work() {
  memset(ys, 1, sizeof(ys));
  memset(ddl, 0, sizeof(ddl));
  int tot = n;
  for (int k = 1; k <= q; ++k) {
    int tim = tsk[k].t;
    if (k != 1) {
      for (int i = 1; i <= n; ++i)
        if (ddl[i] < tim && !ys[i]) {
          ys[i] = 1;
          ddl[i] = 0;
          tot++;
        }
    }
    if (tot >= tsk[k].k) {
      int sum = 0, in = 0;
      for (int i = 1; i <= n; ++i) {
        if (!ys[i]) continue;
        in++;
        ys[i] = 0;
        ddl[i] = tim + tsk[k].d - 1;
        sum += i;
        if (in == tsk[k].k) break;
      }
      tot -= tsk[k].k;
      printf("%d\n", sum);
    } else
      printf("-1\n");
  }
}
int main() {
  init();
  work();
  return 0;
}
