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 <typename T>
bool chmax(T& a, const T& b) {
  return a < b ? (a = b, true) : false;
}
template <typename T>
bool chmin(T& a, const T& b) {
  return b < a ? (a = b, true) : false;
}
int N, Q;
bool used[10001][101];
struct st {
  int t, k, d;
  bool operator<(const st& other) const { return this->t < other.t; }
};
int main() {
  scanf("%d%d", &N, &Q);
  fill(used[0], used[N + 1], true);
  fill(used[0], used[1], false);
  vector<st> query(Q);
  for (int i = (0); i < (Q); i++) {
    scanf("%d%d%d", &query[i].t, &query[i].k, &query[i].d);
  }
  vector<int> ans(Q);
  for (int i = (0); i < (Q); i++) {
    int nxt = lower_bound((query).begin(), (query).end(),
                          st({query[i].t + query[i].d, 0, 0})) -
              query.begin();
    int cnt = 0;
    for (int j = 1; j <= N; j++) {
      cnt += used[i][j] == false;
    }
    if (cnt < query[i].k) {
      for (int j = 1; j <= N; j++) {
        used[i + 1][j] &= used[i][j];
      }
      ans[i] = -1;
      continue;
    }
    cnt = 0;
    for (int j = 1; j <= N; j++)
      if (used[i][j] == false) {
        if (cnt < query[i].k) {
          ans[i] += j;
          used[i][j] = true;
          used[nxt][j] = false;
          cnt++;
        } else {
          used[i + 1][j] &= used[i][j];
        }
      }
  }
  for (int i = (0); i < (Q); i++) {
    printf("%d\n", ans[i]);
  }
  return 0;
}
