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;
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
void solve() {
  long long n, q1;
  cin >> n >> q1;
  long long prev = 0, curr = n;
  set<pair<long long, pair<long long, pair<long long, long long>>>> q;
  set<long long> s;
  for (int i = 1; i <= n; i++) {
    s.insert(i);
  }
  for (int i = 1; i <= q1; i++) {
    long long a, b, c;
    cin >> a >> b >> c;
    while (q.size() > 0) {
      auto it = q.begin();
      pair<long long, pair<long long, pair<long long, long long>>> p = *it;
      if (p.first >= a) {
        break;
      }
      curr = curr + p.second.first;
      for (int j = p.second.second.first; j <= p.second.second.second; j++) {
        s.insert(j);
      }
      q.erase(it);
    }
    if (curr >= b) {
      long long count = 0;
      long long str = *(s.begin());
      long long end;
      long long sum = 0;
      for (auto it : s) {
        count++;
        sum += it;
        end = it;
        s.erase(it);
        if (count == b) {
          break;
        }
      }
      curr = curr - b;
      q.insert({a + c - 1, {b, {str, end}}});
      cout << sum << '\n';
    } else {
      cout << -1 << '\n';
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  for (int i = 0; i < t; ++i) {
    solve();
  }
  return 0;
}
