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>
#pragma comment(linker, "/STACK:102400000, 102400000")
#pragma GCC optimize("O2")
using namespace std;
typedef struct edge {
  int dest, w;
  struct edge* next;
} edge;
typedef struct {
  int val;
  edge* adj;
} vertex;
typedef struct {
  vertex vexList[100];
  int v, e;
} Graph;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double PI = 3.14159265358979323846;
const int maxn = 1e5 + 100;
typedef struct {
  int t, k, d;
} task;
task tsk[maxn];
int flag[maxn];
int n, q;
int main() {
  int i, j, free, sum;
  scanf("%d%d", &n, &q);
  for (i = 1; i <= q; ++i) scanf("%d%d%d", &tsk[i].t, &tsk[i].k, &tsk[i].d);
  for (i = 1; i <= q; ++i) {
    free = sum = 0;
    for (j = 1; j <= n; ++j)
      flag[j] - (tsk[i].t - tsk[i - 1].t) > 0
          ? flag[j] -= (tsk[i].t - tsk[i - 1].t)
          : flag[j] = 0;
    for (j = 1; j <= n && free < tsk[i].k; ++j)
      if (!flag[j]) free++;
    if (free < tsk[i].k) {
      printf("-1\n");
      continue;
    }
    free = 0;
    for (j = 1; j <= n && free < tsk[i].k; ++j)
      if (!flag[j]) free++, sum += j, flag[j] = tsk[i].d;
    printf("%d\n", sum);
  }
  return 0;
}
