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;
const int qq = 1e6 + 4000;
struct Task {
  long long s, c, t;
  int id;
  long long sum;
} task[qq];
int vis[qq];
int to[qq];
int num[110];
vector<int> v[qq];
int cmp(Task &a, Task &b) { return a.id < b.id; }
int main() {
  long long n, q;
  cin >> n >> q;
  for (int i = 0; i < q; ++i) cin >> task[i].s >> task[i].c >> task[i].t;
  for (int i = 0; i < q; ++i) task[i].id = i;
  memset(vis, 0, sizeof(vis));
  memset(num, 0, sizeof(num));
  memset(to, -1, sizeof(to));
  int count = 0;
  for (int i = 0; i < q; ++i) to[task[i].s] = count++;
  long long p = n;
  int r = 1;
  for (int i = 1; i <= 1e6 + 1; ++i) {
    if (vis[i]) {
      for (int j = 0; j < v[vis[i]].size(); ++j) num[v[vis[i]][j]] = 1;
      p += v[vis[i]].size();
      v[vis[i]].clear();
    }
    if (to[i] >= 0) {
      if (p >= task[to[i]].c) {
        p -= task[to[i]].c;
        vis[i + task[to[i]].t] = r;
        int res = 0;
        int k = task[to[i]].c;
        for (int i = 1; i <= n && k; ++i) {
          if (!num[i]) {
            num[i] = 1;
            res += i;
            v[r].push_back(i);
            k--;
          }
        }
        task[to[i]].sum = res;
      } else
        task[to[i]].sum = -1;
    }
  }
  sort(task, task + q, cmp);
  for (int i = 0; i < q; ++i) cout << task[i].sum << endl;
  return 0;
}
