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;
struct O {
  int t, k, d, id;
  bool operator<(const O& o) const { return t < o.t; }
};
const int MXQ = 1e5 + 1;
int ID[(int)1e6 + 1] = {};
int ans[MXQ] = {};
O qs[MXQ] = {};
int main() {
  int N, Q;
  cin >> N >> Q;
  priority_queue<int, vector<int>, greater<int> > pq;
  priority_queue<pair<int, int> > ret;
  for (int x = 0; x < N; x++) pq.push(x + 1);
  for (int x = 0; x < Q; x++)
    qs[x].id = x, cin >> qs[x].t >> qs[x].k >> qs[x].d, ID[qs[x].t] = x + 1;
  sort(qs, qs + Q);
  for (int x = 1; x <= (int)1e6; x++) {
    while (!ret.empty() && -ret.top().first == x)
      pq.push(ret.top().second), ret.pop();
    if (ID[x]) {
      int k = qs[ID[x] - 1].k, d = qs[ID[x] - 1].d;
      if (((int)(pq).size()) >= k) {
        while (k--) {
          int tmp = pq.top();
          pq.pop();
          ans[qs[ID[x] - 1].id] += tmp;
          ret.push({-(d + x), tmp});
        }
      } else {
        ans[qs[ID[x] - 1].id] = -1;
      }
    }
  }
  for (int x = 0; x < Q; x++) cout << ans[x] << "\n";
}
