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;
int work[103];
int n;
int q;
int arT[100004];
int arK[100004];
int arD[100004];
int arrange(int k, int d) {
  vector<int> v;
  for (int i = 1; i <= n; ++i)
    if (work[i] == 0) v.push_back(i);
  if (v.size() < k)
    return -1;
  else {
    int sum = 0;
    for (int i = 0; i < k; ++i) {
      work[v[i]] += d;
      sum += v[i];
    }
    return sum;
  }
}
void pass(int t) {
  for (int i = 1; i <= n; ++i) {
    work[i] -= t;
    if (work[i] < 0) work[i] = 0;
  }
}
void init() {
  memset(work, 0, sizeof(work));
  memset(arT, 0, sizeof(arT));
  memset(arK, 0, sizeof(arK));
  memset(arD, 0, sizeof(arD));
}
int main() {
  init();
  cin >> n >> q;
  for (int i = 1; i <= q; ++i) {
    cin >> arT[i] >> arK[i] >> arD[i];
  }
  for (int i = 1; i <= q; ++i) {
    int dt = arT[i] - arT[i - 1];
    pass(dt);
    int res = arrange(arK[i], arD[i]);
    cout << res << endl;
  }
  return 0;
}
