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:256000000")
using namespace std;
const long long INF = 1e18;
const long long MOD = long long(1e9) + 7;
const long long P = 259;
const long double EPS = 1e-10;
const long double PI = acos(-1.0);
vector<long long> ser;
void source() {
  ios::sync_with_stdio(!"NE NADO");
  long long n, q, t, k, d, mx, cur, s, sum;
  cin >> n >> q;
  ser.resize(n);
  for (long long i = 0; i < q; ++i) {
    cin >> t >> k >> d;
    mx = 0;
    cur = 0;
    s = 0;
    sum = 0;
    for (long long j = 0; j < n; ++j) {
      if (ser[j] <= t) {
        cur++;
      } else {
        cur = 0;
        s = i + 1;
      }
      mx = max(mx, cur);
    }
    if (mx < k) {
      cout << -1 << endl;
    } else {
      for (long long j = s; j < s + k; ++j) {
        sum += j + 1;
        ser[j] = t + d;
      }
      cout << sum << endl;
    }
  }
}
int main() {
  srand(time(0));
  source();
  return 0;
}
