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 flist {
  int val;
  int pos;
};
int remain[101];
bool occup[101];
bool acomp(flist a, flist b) {
  if (a.val > b.val) {
    return true;
  }
  if (a.val == b.val) {
    return a.pos > b.pos;
  }
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int i, j;
  int n, q;
  cin >> n >> q;
  ;
  memset(remain, 0, sizeof(remain));
  ;
  memset(occup, 0, sizeof(occup));
  ;
  int t[q];
  int k[q];
  int d[q];
  int last = t[0];
  for (i = 0; i < q - 1; i++) {
    int tt, kk, dd;
    cin >> t[i] >> k[i] >> d[i];
    ;
    int ans = 0;
    int curk = 0;
    for (j = 0; j < n; j++) {
      if (curk == k[i]) {
        break;
      }
      if (remain[j] == 0) {
        ans += j + 1;
        remain[j] = d[i];
        curk++;
      } else if (remain[j] - (t[i] - last) <= 0) {
        ans += j + 1;
        remain[j] = d[i];
        curk++;
      }
    }
    last = t[i];
    if (curk != k[i]) {
      printf("-1\n");
    } else {
      printf("%d\n", ans);
    }
  }
  cin >> t[n - 1] >> k[n - 1] >> d[n - 1];
  ;
  if (k[n - 1] > n) {
    printf("-1\n");
    return 0;
  }
  flist ar[n];
  for (i = 0; i < n; i++) {
    ar[i].val = remain[i];
    ar[i].pos = i;
  }
  int ans = 0;
  sort(ar, ar + n, acomp);
  for (i = 0; i < k[n - 1]; i++) {
    ans += (ar[i].pos + 1);
  }
  printf("%d\n", ans);
}
