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 N = 100010;
inline int in() {
  int x;
  scanf("%d", &x);
  return x;
}
inline long long lin() {
  long long x;
  scanf("%I64d", &x);
  return x;
}
struct Info {
  int ti, ki, di;
  Info() {}
  Info(int _ti, int _ki, int _di) {
    ti = _ti;
    ki = _ki;
    di = _di;
  }
  bool operator<(const Info& other) const { return ti < other.ti; }
} inp[N];
int n, q;
int server[105];
int main() {
  n = in();
  q = in();
  for (int i = 1; i <= q; i++) {
    int ti = in(), ki = in(), di = in();
    inp[i] = Info(ti, ki, di);
  }
  sort(inp + 1, inp + q + 1);
  for (int i = 1; i <= q; i++) {
    int how = 0;
    for (int j = 1; j <= n; j++) {
      if (server[j] < inp[i].ti) {
        server[j] = 0;
      }
      if (server[j] == 0) how++;
    }
    int sum = 0;
    if (how < inp[i].ki)
      sum = -1;
    else {
      for (int j = 1; j <= n; j++) {
        if (server[j] == 0 && inp[i].ki > 0) {
          server[j] = inp[i].ti + inp[i].di - 1;
          inp[i].ki--;
          sum += j;
        }
      }
    }
    printf("%d\n", sum);
  }
}
