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;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
template <typename T>
using VT = vector<T>;
const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;
int N, Q;
VI T, K, D;
int main(void) {
  scanf("%d%d", &N, &Q);
  T.resize(Q);
  K = T;
  D = K;
  for (int(i) = 0; (i) < (Q); (i)++) {
    scanf("%d%d%d", &T[i], &K[i], &D[i]);
  }
  VI nextCanMoveTime(N, 0);
  for (int(i) = 0; (i) < (Q); (i)++) {
    int cnt = 0;
    int out = 0;
    for (int(j) = 0; (j) < (N); (j)++) {
      if (nextCanMoveTime[j] <= T[i]) {
        cnt++;
        nextCanMoveTime[j] = T[i] + D[i];
        out += j + 1;
      }
      if (cnt == K[i]) break;
    }
    printf("%d\n", (cnt == K[i] ? out : -1));
  }
}
