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 long long N = 1e+6, oo = 1e+18, M = (1e+9) + 7;
int n, m, t, k, d;
int main() {
  int now, x, y;
  scanf("%d%d", &n, &m);
  set<pair<int, int> > s, inverse;
  set<pair<int, pair<int, int> > > time;
  set<pair<int, int> >::iterator it, it2;
  set<pair<int, pair<int, int> > >::iterator it3;
  s.insert({101, 0}), inverse.insert({101, 0});
  s.insert({1, n});
  inverse.insert({1, n});
  for (int i = 0; i < m; ++i) {
    int c = 0, sum = 0, l, r, z;
    x = 0;
    scanf("%d%d%d", &t, &k, &d);
    now = t;
    while (1) {
      if (time.size() == 0) break;
      it3 = time.begin();
      if (it3->first >= now) break;
      z = it3->first;
      r = it3->second.second;
      l = it3->second.first;
      time.erase({z, {l, r}});
      it = s.lower_bound({r, 0});
      it2 = inverse.lower_bound({l - 1, 0});
      if (it->first != 101 && it->first == r + 1) {
        r = it->second;
        s.erase({it->first, it->second});
        inverse.erase({it->second, it->first});
      }
      if (it2->first != 101 && it2->first + 1 == l) {
        l = it2->second;
        inverse.erase({it2->first, it2->second});
        s.erase({it2->second, it2->first});
      }
      s.insert({l, r});
      inverse.insert({r, l});
    }
    while (1) {
      if (s.size() == 1) {
        printf("%d\n", -1);
        break;
      }
      it = s.begin();
      l = it->first, r = it->second, z;
      if (c + (r - l + 1) == k) {
        sum += (r * (r + 1)) / 2 - (l * (l - 1)) / 2;
        printf("%d\n", sum);
        s.erase({l, r});
        inverse.erase({r, 1});
        time.insert({t + d - 1, {l, r}});
        break;
      } else if (c + (r - l + 1) > k) {
        s.erase({l, r});
        inverse.erase({r, 1});
        z = l + k - 1;
        sum += (z * (z + 1)) / 2 - (l * (l - 1)) / 2;
        printf("%d\n", sum);
        s.insert({z + 1, r});
        inverse.insert({r, z + 1});
        time.insert({t + d - 1, {l, z}});
        break;
      } else {
        for (it = s.begin(); it != s.end(); it++)
          if (it->first != 101) x += it->second - it->first + 1;
        if (x < k) {
          printf("%d\n", -1);
          break;
        }
        s.erase({l, r});
        inverse.erase({r, 1});
        time.insert({t + d - 1, {l, r}});
        c += (r - l + 1);
        sum += (r * (r + 1)) / 2 - (l * (l - 1)) / 2;
      }
    }
  }
  return 0;
}
