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 data {
  long long t, k, d;
  data() {}
  data(long long t, long long k, long long d) : t(t), k(k), d(d) {}
};
long long n, q;
data a[100010];
long long vis[100010];
long long need[100010];
map<long long, vector<long long> > f;
int main() {
  scanf("%lld %lld", &n, &q);
  for (long long i = 1; i <= q; ++i)
    scanf("%lld %lld %lld", &a[i].t, &a[i].k, &a[i].d);
  long long T = 0, K = 0, D = 0;
  long long vtime = 0;
  set<long long> myset;
  for (long long i = 1; i <= n; ++i) myset.insert(i);
  vector<long long> fact;
  for (long long j = 1; j <= n; ++j) need[j] = 0;
  fill(vis, vis + n + 5, 1);
  for (long long i = 1; i <= q; ++i) {
    vtime = a[i].t;
    for (long long j = 1; j <= n; ++j)
      if (need[j] <= a[i].t) {
        fact.push_back(j);
        vis[j] = 1;
      }
    fact.resize(distance(fact.begin(), unique(fact.begin(), fact.end())));
    if (fact.size() < a[i].k)
      cout << "-1\n";
    else {
      long long ans = 0;
      for (long long j = 0; j < a[i].k; ++j) {
        ans += fact[j];
        vis[fact[j]] = 0;
        need[fact[j]] = max(need[fact[j]], vtime + a[i].d);
      }
      fact.clear();
      for (long long j = 1; j <= n; ++j)
        if (vis[j]) fact.push_back(j);
      cout << ans << endl;
      sort(fact.begin(), fact.end());
    }
  }
  return 0;
}
