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 T {
  int t, k, d, fin;
  vector<int> ids;
  T(int t, int k, int d) : t(t), k(k), d(d) { fin = t + d - 1; }
  T() : T(0, 0, 0) {}
  bool operator<(const T &other) const { return fin < other.fin; }
};
int n, q;
vector<T> vv;
int read() {
  if (scanf("%d%d", &n, &q) < 2) {
    return 0;
  }
  vv.clear();
  int t, d, k;
  for (int i = 0; i < q; i++) {
    scanf("%d%d%d", &t, &k, &d);
    vv.push_back(T(t, k, d));
  }
  return 1;
}
priority_queue<T> Q;
int srv[200];
void solve() {
  int free = n;
  int tt = 0;
  for (int i = 0; i < q; i++) {
    if (Q.size() > 0 && Q.top().fin == tt) {
      T qtp = Q.top();
      free += qtp.k;
      for (auto &i : qtp.ids) {
        srv[i] = 0;
      }
      assert(free <= n);
      Q.pop();
    }
    tt++;
    int need = vv[i].k;
    if (need > free) {
      printf("-1\n");
    } else {
      free -= need;
      vector<int> ids;
      int ans = 0;
      int kk = vv[i].k;
      for (int i = 1; i <= n; i++) {
        if (kk == 0) break;
        if (srv[i] == 0) {
          ans += i;
          kk--;
          srv[i] = 1;
          ids.push_back(i);
        }
      }
      printf("%d\n", ans);
      vv[i].ids = ids;
      Q.push(vv[i]);
    }
  }
}
int main(int argc, char *argv[]) {
  while (read()) {
    solve();
  }
}
