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 E {
  int tm;
  int id;
  int tag;
  E() {}
  E(int a, int b, int c) : tm(a), id(b), tag(c) {}
};
struct ECmp {
  ECmp() {}
  bool operator()(const E &a, const E &b) {
    if (a.tm != b.tm)
      return a.tm > b.tm;
    else
      return a.tag < b.tag;
  }
};
vector<int> ans[100005];
int main() {
  int n, q;
  cin >> n >> q;
  vector<int> start(q), cost(q), tm(q);
  priority_queue<E, vector<E>, ECmp> events;
  for (int i = 0; i < q; i++) {
    int a, b, c;
    cin >> a >> b >> c;
    start[i] = a;
    cost[i] = b;
    tm[i] = c;
    events.push(E(a, i, -1));
  }
  set<int> servers;
  for (int i = 1; i <= n; i++) servers.insert(i);
  while (events.size() > 0) {
    E e = events.top();
    events.pop();
    if (e.tag < 0) {
      if (servers.size() < cost[e.id])
        cout << -1 << endl;
      else {
        events.push(E(e.tm + tm[e.id], e.id, 1));
        int sum = 0;
        for (int k = 0; k < cost[e.id]; k++) {
          int x = *servers.begin();
          servers.erase(servers.begin());
          sum += x;
          ans[e.id].push_back(x);
        }
        cout << sum << endl;
      }
    } else {
      for (int i = 0; i < ans[e.id].size(); i++) servers.insert(ans[e.id][i]);
    }
  }
  return 0;
}
