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;
vector<vector<int> > vis[1000000 + 2];
int used[1000000 + 2] = {}, vi[1000000 + 2] = {};
set<int> S;
pair<pair<int, int>, int> Q[1000000 + 2];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int i, j, n, q, t, k, d;
  cin >> n >> q;
  for (i = 1; i <= n; i++) S.insert(i);
  for (i = 0; i < q; i++) {
    cin >> t >> k >> d;
    Q[t] = {{t, k}, d};
    used[t] = 1;
    if (t + d <= 1000000) vi[t + d] = 1;
  }
  for (i = 1; i <= 1000000; i++) {
    if (!used[i] && !vi[i]) continue;
    if (vi[i]) {
      for (j = 0; j < vis[i].size(); j++) {
        vector<int> VV = vis[i][j];
        for (int ii = 0; ii < VV.size(); ii++) S.insert(VV[ii]);
      }
    }
    if (used[i]) {
      t = i;
      k = Q[i].first.second;
      d = Q[i].second;
      if (S.size() < k) {
        cout << -1 << '\n';
        continue;
      }
      set<int>::iterator it;
      vector<int> V;
      int ans = 0;
      int cnt = 0;
      for (it = S.begin(); it != S.end(); it++) {
        if (cnt == k) break;
        V.push_back(*it);
        ans += *it;
        cnt++;
      }
      for (j = 0; j < V.size(); j++) S.erase(V[j]);
      cout << ans << '\n';
      vis[t + d].push_back(V);
    }
  }
  return 0;
}
