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 maxn = 1e5 + 5;
struct task {
  int t, k, d;
  int id;
  bool operator<(const task& b) const { return t < b.t; }
} p[maxn];
struct sever {
  int id, t;
  bool operator<(const sever& b) const { return t > b.t; }
  sever(int _id, int _t) : id(_id), t(_t) {}
};
struct severv {
  int id;
  bool operator<(const severv& b) const { return id > b.id; }
  severv(int _id) : id(_id) {}
};
int res[maxn];
int main() {
  priority_queue<sever> sev;
  priority_queue<severv> que;
  int n;
  scanf("%d", &n);
  for (int i = (1); i < (n + 1); i++) que.push(severv(i));
  int q;
  scanf("%d", &q);
  for (int i = (0); i < (q); i++) {
    scanf("%d%d%d", &p[i].t, &p[i].k, &p[i].d);
    p[i].id = i;
  }
  sort(p, p + q);
  for (int i = (0); i < (q); i++) {
    while (!sev.empty()) {
      if (sev.top().t < p[i].t) {
        que.push(severv(sev.top().id));
        sev.pop();
      } else
        break;
    }
    if (que.size() >= p[i].k) {
      int ans = 0;
      for (int j = (0); j < (p[i].k); j++) {
        sev.push(sever(que.top().id, p[i].t + p[i].d - 1));
        ans += que.top().id;
        que.pop();
      }
      res[p[i].id] = ans;
    } else {
      res[p[i].id] = -1;
    }
  }
  for (int i = (0); i < (q); i++) printf("%d\n", res[i]);
  return 0;
}
