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;
namespace Stand_IO_Operation {
inline int read() {
  int f = 1, res = 0, ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') res = res * 10 + ch - 48, ch = getchar();
  return f * res;
}
int _sta[1 << 8];
inline void write(int val) {
  if (!val) {
    putchar('0');
    return;
  }
  if (val < 0) putchar('-'), val = -val;
  *_sta = 0;
  while (val > 0) _sta[++*_sta] = val % 10, val /= 10;
  for (int i = *_sta, _Lim = 1; i >= _Lim; i--) putchar(_sta[i] + 48);
}
};  // namespace Stand_IO_Operation
using namespace Stand_IO_Operation;
const int N = 105;
const int M = 100005;
const int T = 1000005;
vector<int> V[T + 1000];
int S[N], Time;
void Going() {
  Time++;
  for (int i = 0; i < V[Time].size(); i++) S[V[Time][i]] = true;
}
int n, m;
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1, _Lim = n; i <= _Lim; i++) S[i] = true;
  for (int i = 1, _Lim = m; i <= _Lim; i++) {
    int t = read(), k = read(), d = read();
    while (Time < t) Going();
    int cnt = 0, res = 0;
    for (int j = 1, _Lim = n; j <= _Lim; j++)
      if (S[j]) {
        cnt++;
        res += j;
        if (cnt == k) break;
      }
    if (cnt == k) {
      cnt = 0;
      for (int j = 1, _Lim = n; j <= _Lim; j++)
        if (S[j]) {
          cnt++;
          S[j] = false;
          V[Time + d].push_back(j);
        }
    }
    if (cnt < k)
      puts("-1");
    else
      printf("%d\n", res);
  }
}
