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 = 26;
const int MAXM = 100010;
const int MAXP = 666666;
const int MAX = 1e5 + 5;
const int maxn = 1e3 + 5;
const int mod = 1000000007;
const double eps = 1e-7;
const int N = 36;
int ca = 1;
struct P {
  int id, en;
};
bool operator<(const P& a, const P& b) {
  if (a.en == b.en) return a.id > b.id;
  return a.en > b.en;
}
priority_queue<P> q1, q2;
int n, q;
int tt = 0;
void solve() {
  while (~scanf("%d%d", &n, &q)) {
    for (int i = 1; i <= n; i++) q1.push((P){i, 0});
    while (q--) {
      int sum = 0;
      int a, b, c;
      scanf("%d%d%d", &a, &b, &c);
      tt = a;
      while (!q2.empty() && q2.top().en < tt) {
        P temp = q2.top();
        temp.en = 0;
        q1.push(temp);
        q2.pop();
      }
      if (q1.size() < b) {
        puts("-1");
        continue;
      }
      while (b--) {
        P temp = q1.top();
        q1.pop();
        temp.en = tt + c - 1;
        sum += temp.id;
        q2.push(temp);
      }
      printf("%d\n", sum);
    }
  }
}
int main() {
  int t = 1;
  while (t--) solve();
  return 0;
}
