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;
template <class T>
void chmin(T &t, const T &f) {
  if (t > f) t = f;
}
template <class T>
void chmax(T &t, const T &f) {
  if (t < f) t = f;
}
int mod = 1e9 + 7;
double pi = 3.1415926535897932384;
struct mysort {
  bool operator()(pair<int, pair<int, int> > p1,
                  pair<int, pair<int, int> > p2) {
    if (p1.second.first == p2.second.first) return p1.first > p2.first;
    return p1.second.first < p2.second.first;
  }
};
int main() {
  int n, q, vis[100005] = {0}, ser[105] = {0}, need[100005] = {0};
  vector<int> v[100005];
  vector<pair<int, pair<int, int> > > p;
  scanf("%d %d", &n, &q);
  for (int i = 0; i < q; ++i) {
    int t, k, d;
    scanf("%d %d %d", &t, &k, &d);
    need[i] = k;
    p.push_back(make_pair(0, make_pair(t, i)));
    p.push_back(make_pair(1, make_pair(t + d, i)));
  }
  sort(p.begin(), p.end(), mysort());
  for (int i = 0; i < p.size(); ++i) {
    pair<int, pair<int, int> > pi = p[i];
    if (pi.first) {
      for (int j = 0; j < v[pi.second.second].size(); ++j)
        ser[v[pi.second.second][j]] = 0;
    } else {
      int ans = 0;
      for (int j = 0; j < n && need[pi.second.second]; ++j) {
        if (!ser[j]) {
          v[pi.second.second].push_back(j);
          need[pi.second.second]--;
          ans += j + 1;
        }
      }
      if (need[pi.second.second]) {
        v[pi.second.second].clear();
        printf("-1\n");
      } else {
        for (int j = 0; j < v[pi.second.second].size(); ++j)
          ser[v[pi.second.second][j]] = 1;
        printf("%d\n", ans);
      }
    }
  }
  return 0;
}
