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 int MAXN = 1e3 + 5;
const int oo = 0x3f3f3f3f;
inline int read() {
  char ch = getchar();
  int x = 0, f = 1;
  while (ch > '9' || ch < '0') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
int N, Q, now, ned;
long long ans = 0;
struct Task {
  int t, k, d;
} task[MAXN];
priority_queue<pair<int, int>, vector<pair<int, int> >,
               greater<pair<int, int> > >
    mac;
pair<int, int> q[MAXN];
namespace solution {
void Prepare() {
  N = read();
  Q = read();
  for (int i = 1; i <= Q; i++) {
    int t = read(), k = read(), d = read();
    task[i] = (Task){t, k, d};
  }
  for (int i = 1; i <= N; i++) mac.push(make_pair(0, i));
}
void Slove() {
  for (int i = 1; i <= Q; i++) {
    ans = 0;
    bool flag = 0;
    now = task[i].t;
    ned = task[i].k;
    for (int j = 1; j <= ned; j++) {
      q[j] = mac.top();
      mac.pop();
      ans += q[j].second;
      if (q[j].first >= now) {
        for (int k = j; k >= 1; k--) mac.push(q[k]);
        puts("-1");
        flag = 1;
        break;
      }
    }
    if (flag) continue;
    printf("%d\n", ans);
    for (int j = 1; j <= ned; j++) {
      q[j].first = task[i].t + task[i].d - 1;
      mac.push(q[j]);
    }
  }
}
}  // namespace solution
int main() {
  using namespace solution;
  Prepare();
  Slove();
  return 0;
}
