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;
priority_queue<int, vector<int>, greater<int> > que, root;
vector<int> vis[1001000];
vector<int> ans;
int check[1000000 + 10000];
int main() {
  int n, q, now;
  cin >> n >> q;
  now = n;
  for (int i = 1; i <= n; i++) root.push(i);
  for (int i = 0; i < q; i++) {
    int begin, need, end;
    cin >> begin >> need >> end;
    while (!que.empty() && que.top() < begin) {
      int pos = que.top();
      que.pop();
      for (int j = 0; j < vis[pos].size(); j++) {
        root.push(vis[pos][j]);
      }
      now += vis[pos].size();
    }
    if (need <= now) {
      int res = 0;
      for (int j = 1; j <= need; j++) {
        res += root.top();
        vis[begin + end - 1].push_back(root.top());
        root.pop();
      }
      now -= need;
      ans.push_back(res);
      if (check[begin + end - 1] == false)
        que.push(begin + end - 1), check[begin + end - 1] = true;
    } else {
      ans.push_back(-1);
    }
  }
  for (int i = 0; i < ans.size(); i++) printf("%d\n", ans[i]);
}
