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;
int main() {
  int n, q;
  cin >> n >> q;
  vector<int> t(q);
  vector<int> d(q);
  vector<int> k(q);
  vector<vector<int> > resp(q, vector<int>(0));
  vector<pair<int, pair<int, int> > > ev(0);
  for (int i = 0; i < q; i++) {
    scanf("%d %d %d", &t[i], &k[i], &d[i]);
    ev.push_back(make_pair(t[i], make_pair(1, i)));
    ev.push_back(make_pair(t[i] + d[i], make_pair(-1, i)));
  }
  sort(ev.begin(), ev.end());
  vector<int> free(n, 1);
  int num_free = n;
  for (auto event : ev) {
    int id = event.second.second;
    int num_s = k[id];
    if (event.second.first == -1) {
      for (auto serv : resp[id]) {
        free[serv] = 1;
      }
      if (!resp[id].empty()) {
        num_free += num_s;
      }
    } else {
      if (num_free >= num_s) {
        int ans = num_s;
        num_free -= num_s;
        int cnt = 0;
        for (int i = 0; i < n && cnt < num_s; i++) {
          if (free[i] == 1) {
            free[i] = 0;
            resp[id].push_back(i);
            ans += i;
            cnt++;
          }
        }
        printf("%d\n", ans);
      } else {
        resp[id].clear();
        printf("-1\n");
      }
    }
  }
}
